## 10479

10,479 (ten thousand four hundred seventy-nine) is an odd five-digits composite number following 10478 and preceding 10480. In scientific notation, it is written as 1.0479 × 104. The sum of its digits is 21. It has a total of 3 prime factors and 8 positive divisors. There are 5,976 positive integers (up to 10479) that are relatively prime to 10479.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 21
• Digital Root 3

## Name

Short name 10 thousand 479 ten thousand four hundred seventy-nine

## Notation

Scientific notation 1.0479 × 104 10.479 × 103

## Prime Factorization of 10479

Prime Factorization 3 × 7 × 499

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 10479 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) -1 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 0 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 10,479 is 3 × 7 × 499. Since it has a total of 3 prime factors, 10,479 is a composite number.

## Divisors of 10479

1, 3, 7, 21, 499, 1497, 3493, 10479

8 divisors

 Even divisors 0 8 4 4
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 16000 Sum of all the positive divisors of n s(n) 5521 Sum of the proper positive divisors of n A(n) 2000 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 102.367 Returns the nth root of the product of n divisors H(n) 5.2395 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 10,479 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 10,479) is 16,000, the average is 2,000.

## Other Arithmetic Functions (n = 10479)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 5976 Total number of positive integers not greater than n that are coprime to n λ(n) 498 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 1282 Total number of primes less than or equal to n r2(n) 0 The number of ways n can be represented as the sum of 2 squares

There are 5,976 positive integers (less than 10,479) that are coprime with 10,479. And there are approximately 1,282 prime numbers less than or equal to 10,479.

## Divisibility of 10479

 m n mod m 2 3 4 5 6 7 8 9 1 0 3 4 3 0 7 3

The number 10,479 is divisible by 3 and 7.

## Classification of 10479

• Arithmetic
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

### Other numbers

• LucasCarmichael
• Sphenic

## Base conversion (10479)

Base System Value
2 Binary 10100011101111
3 Ternary 112101010
4 Quaternary 2203233
5 Quinary 313404
6 Senary 120303
8 Octal 24357
10 Decimal 10479
12 Duodecimal 6093
20 Vigesimal 163j
36 Base36 833

## Basic calculations (n = 10479)

### Multiplication

n×i
 n×2 20958 31437 41916 52395

### Division

ni
 n⁄2 5239.5 3493 2619.75 2095.8

### Exponentiation

ni
 n2 109809441 1150693132239 12058113332732481 126356969613703668399

### Nth Root

i√n
 2√n 102.367 21.883 10.1177 6.36889

## 10479 as geometric shapes

### Circle

 Diameter 20958 65841.5 3.44977e+08

### Sphere

 Volume 4.82001e+12 1.37991e+09 65841.5

### Square

Length = n
 Perimeter 41916 1.09809e+08 14819.5

### Cube

Length = n
 Surface area 6.58857e+08 1.15069e+12 18150.2

### Equilateral Triangle

Length = n
 Perimeter 31437 4.75489e+07 9075.08

### Triangular Pyramid

Length = n
 Surface area 1.90196e+08 1.3561e+11 8556.07

## Cryptographic Hash Functions

md5 9c0badf6e91e4834393525f7dca1291d d565a077e63c26a665fce0ec0e5da77bb133ea5a 7dd41e237b514a64cb404ede0ddfa462ced85a3c3ef4a46e015c3063ee34cde2 b23b7dbeca7aa7b20b57769d6bbf40369abca5d36c0a13cb9366cca6a08760dcf2ce11ca61354cef666a3b5d21ea93dac50b88f837066d1b373682591c65dd60 dcbe2862a43102556b73a87c40cf6729668bcef6
The text passage provides detailed mathematical and numerical information about the number 10,479, including its properties, prime factorization, divisors, and other arithmetic functions. However, it does not contain any specific mathematical questions or problems to solve.
no_question
Given a text passage, determine:
    1. If it contains a mathematical question (including word problems or calculations)
    2. If an answer to that mathematical question is provided in the text

First, describe the content structure you found in 1-2 sentences.

Then provide your analysis in the following format:
TYPE: <one of the following values>
- NO_QUESTION
- SINGLE_QUESTION
- SINGLE_QUESTION_WITH_ANSWER
- MULTIPLE_QUESTIONS
- MULTIPLE_QUESTIONS_WITH_ANSWERS
system
## 10479

10,479 (ten thousand four hundred seventy-nine) is an odd five-digits composite number following 10478 and preceding 10480. In scientific notation, it is written as 1.0479 × 104. The sum of its digits is 21. It has a total of 3 prime factors and 8 positive divisors. There are 5,976 positive integers (up to 10479) that are relatively prime to 10479.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 21
• Digital Root 3

## Name

Short name 10 thousand 479 ten thousand four hundred seventy-nine

## Notation

Scientific notation 1.0479 × 104 10.479 × 103

## Prime Factorization of 10479

Prime Factorization 3 × 7 × 499

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 10479 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) -1 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 0 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 10,479 is 3 × 7 × 499. Since it has a total of 3 prime factors, 10,479 is a composite number.

## Divisors of 10479

1, 3, 7, 21, 499, 1497, 3493, 10479

8 divisors

 Even divisors 0 8 4 4
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 16000 Sum of all the positive divisors of n s(n) 5521 Sum of the proper positive divisors of n A(n) 2000 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 102.367 Returns the nth root of the product of n divisors H(n) 5.2395 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 10,479 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 10,479) is 16,000, the average is 2,000.

## Other Arithmetic Functions (n = 10479)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 5976 Total number of positive integers not greater than n that are coprime to n λ(n) 498 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 1282 Total number of primes less than or equal to n r2(n) 0 The number of ways n can be represented as the sum of 2 squares

There are 5,976 positive integers (less than 10,479) that are coprime with 10,479. And there are approximately 1,282 prime numbers less than or equal to 10,479.

## Divisibility of 10479

 m n mod m 2 3 4 5 6 7 8 9 1 0 3 4 3 0 7 3

The number 10,479 is divisible by 3 and 7.

## Classification of 10479

• Arithmetic
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

### Other numbers

• LucasCarmichael
• Sphenic

## Base conversion (10479)

Base System Value
2 Binary 10100011101111
3 Ternary 112101010
4 Quaternary 2203233
5 Quinary 313404
6 Senary 120303
8 Octal 24357
10 Decimal 10479
12 Duodecimal 6093
20 Vigesimal 163j
36 Base36 833

## Basic calculations (n = 10479)

### Multiplication

n×i
 n×2 20958 31437 41916 52395

### Division

ni
 n⁄2 5239.5 3493 2619.75 2095.8

### Exponentiation

ni
 n2 109809441 1150693132239 12058113332732481 126356969613703668399

### Nth Root

i√n
 2√n 102.367 21.883 10.1177 6.36889

## 10479 as geometric shapes

### Circle

 Diameter 20958 65841.5 3.44977e+08

### Sphere

 Volume 4.82001e+12 1.37991e+09 65841.5

### Square

Length = n
 Perimeter 41916 1.09809e+08 14819.5

### Cube

Length = n
 Surface area 6.58857e+08 1.15069e+12 18150.2

### Equilateral Triangle

Length = n
 Perimeter 31437 4.75489e+07 9075.08

### Triangular Pyramid

Length = n
 Surface area 1.90196e+08 1.3561e+11 8556.07

## Cryptographic Hash Functions

md5 9c0badf6e91e4834393525f7dca1291d d565a077e63c26a665fce0ec0e5da77bb133ea5a 7dd41e237b514a64cb404ede0ddfa462ced85a3c3ef4a46e015c3063ee34cde2 b23b7dbeca7aa7b20b57769d6bbf40369abca5d36c0a13cb9366cca6a08760dcf2ce11ca61354cef666a3b5d21ea93dac50b88f837066d1b373682591c65dd60 dcbe2862a43102556b73a87c40cf6729668bcef6
user
The text passage provides detailed mathematical and numerical information about the number 10,479, including its properties, prime factorization, divisors, and other arithmetic functions. However, it does not contain any specific mathematical questions or problems to solve.

TYPE: NO_QUESTION