## 21051

21,051 (twenty-one thousand fifty-one) is an odd five-digits composite number following 21050 and preceding 21052. In scientific notation, it is written as 2.1051 × 104. The sum of its digits is 9. It has a total of 3 prime factors and 6 positive divisors. There are 14,028 positive integers (up to 21051) that are relatively prime to 21051.

## Basic properties

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

## Name

Short name 21 thousand 51 twenty-one thousand fifty-one

## Notation

Scientific notation 2.1051 × 104 21.051 × 103

## Prime Factorization of 21051

Prime Factorization 32 × 2339

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 7017 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 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 21,051 is 32 × 2339. Since it has a total of 3 prime factors, 21,051 is a composite number.

## Divisors of 21051

1, 3, 9, 2339, 7017, 21051

6 divisors

 Even divisors 0 6 3 3
Total Divisors Sum of Divisors Aliquot Sum τ(n) 6 Total number of the positive divisors of n σ(n) 30420 Sum of all the positive divisors of n s(n) 9369 Sum of the proper positive divisors of n A(n) 5070 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 145.09 Returns the nth root of the product of n divisors H(n) 4.15207 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 21,051 can be divided by 6 positive divisors (out of which 0 are even, and 6 are odd). The sum of these divisors (counting 21,051) is 30,420, the average is 5,070.

## Other Arithmetic Functions (n = 21051)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 14028 Total number of positive integers not greater than n that are coprime to n λ(n) 7014 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 2371 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 14,028 positive integers (less than 21,051) that are coprime with 21,051. And there are approximately 2,371 prime numbers less than or equal to 21,051.

## Divisibility of 21051

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

The number 21,051 is divisible by 3 and 9.

## Classification of 21051

• Arithmetic
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

## Base conversion (21051)

Base System Value
2 Binary 101001000111011
3 Ternary 1001212200
4 Quaternary 11020323
5 Quinary 1133201
6 Senary 241243
8 Octal 51073
10 Decimal 21051
12 Duodecimal 10223
20 Vigesimal 2ccb
36 Base36 g8r

## Basic calculations (n = 21051)

### Multiplication

n×i
 n×2 42102 63153 84204 105255

### Division

ni
 n⁄2 10525.5 7017 5262.75 4210.2

### Exponentiation

ni
 n2 443144601 9328636995651 196377137395449201 4133935119311601130251

### Nth Root

i√n
 2√n 145.09 27.6116 12.0453 7.32242

## 21051 as geometric shapes

### Circle

 Diameter 42102 132267 1.39218e+09

### Sphere

 Volume 3.90757e+13 5.56872e+09 132267

### Square

Length = n
 Perimeter 84204 4.43145e+08 29770.6

### Cube

Length = n
 Surface area 2.65887e+09 9.32864e+12 36461.4

### Equilateral Triangle

Length = n
 Perimeter 63153 1.91887e+08 18230.7

### Triangular Pyramid

Length = n
 Surface area 7.67549e+08 1.09939e+12 17188.1

## Cryptographic Hash Functions

md5 f8531013695084f6fd79ed6d8e24b2d6 885345a658efc00e4a6178cbf2cda387683c43a9 0d423ea809dc1fe554e256f6503a7827313c3bfc177e33f2e15d8fdd496bf42f c89e854e3fcc9375157d4e8d6042065a9bf83cc8dc04efe78603876039afd6bc14b03ea7116215f8faebea9b796b90cf92343eac2c5ea126bda963e43d2b99fb 45c83aad38d150193457b643ec3043be10c500bd
The provided text passage is a detailed mathematical description of the number 21,051, including its properties, prime factorization, divisors, and other arithmetic functions. 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
## 21051

21,051 (twenty-one thousand fifty-one) is an odd five-digits composite number following 21050 and preceding 21052. In scientific notation, it is written as 2.1051 × 104. The sum of its digits is 9. It has a total of 3 prime factors and 6 positive divisors. There are 14,028 positive integers (up to 21051) that are relatively prime to 21051.

## Basic properties

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

## Name

Short name 21 thousand 51 twenty-one thousand fifty-one

## Notation

Scientific notation 2.1051 × 104 21.051 × 103

## Prime Factorization of 21051

Prime Factorization 32 × 2339

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 7017 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 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 21,051 is 32 × 2339. Since it has a total of 3 prime factors, 21,051 is a composite number.

## Divisors of 21051

1, 3, 9, 2339, 7017, 21051

6 divisors

 Even divisors 0 6 3 3
Total Divisors Sum of Divisors Aliquot Sum τ(n) 6 Total number of the positive divisors of n σ(n) 30420 Sum of all the positive divisors of n s(n) 9369 Sum of the proper positive divisors of n A(n) 5070 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 145.09 Returns the nth root of the product of n divisors H(n) 4.15207 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 21,051 can be divided by 6 positive divisors (out of which 0 are even, and 6 are odd). The sum of these divisors (counting 21,051) is 30,420, the average is 5,070.

## Other Arithmetic Functions (n = 21051)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 14028 Total number of positive integers not greater than n that are coprime to n λ(n) 7014 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 2371 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 14,028 positive integers (less than 21,051) that are coprime with 21,051. And there are approximately 2,371 prime numbers less than or equal to 21,051.

## Divisibility of 21051

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

The number 21,051 is divisible by 3 and 9.

## Classification of 21051

• Arithmetic
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

## Base conversion (21051)

Base System Value
2 Binary 101001000111011
3 Ternary 1001212200
4 Quaternary 11020323
5 Quinary 1133201
6 Senary 241243
8 Octal 51073
10 Decimal 21051
12 Duodecimal 10223
20 Vigesimal 2ccb
36 Base36 g8r

## Basic calculations (n = 21051)

### Multiplication

n×i
 n×2 42102 63153 84204 105255

### Division

ni
 n⁄2 10525.5 7017 5262.75 4210.2

### Exponentiation

ni
 n2 443144601 9328636995651 196377137395449201 4133935119311601130251

### Nth Root

i√n
 2√n 145.09 27.6116 12.0453 7.32242

## 21051 as geometric shapes

### Circle

 Diameter 42102 132267 1.39218e+09

### Sphere

 Volume 3.90757e+13 5.56872e+09 132267

### Square

Length = n
 Perimeter 84204 4.43145e+08 29770.6

### Cube

Length = n
 Surface area 2.65887e+09 9.32864e+12 36461.4

### Equilateral Triangle

Length = n
 Perimeter 63153 1.91887e+08 18230.7

### Triangular Pyramid

Length = n
 Surface area 7.67549e+08 1.09939e+12 17188.1

## Cryptographic Hash Functions

md5 f8531013695084f6fd79ed6d8e24b2d6 885345a658efc00e4a6178cbf2cda387683c43a9 0d423ea809dc1fe554e256f6503a7827313c3bfc177e33f2e15d8fdd496bf42f c89e854e3fcc9375157d4e8d6042065a9bf83cc8dc04efe78603876039afd6bc14b03ea7116215f8faebea9b796b90cf92343eac2c5ea126bda963e43d2b99fb 45c83aad38d150193457b643ec3043be10c500bd
user
The provided text passage is a detailed mathematical description of the number 21,051, including its properties, prime factorization, divisors, and other arithmetic functions. It does not contain any specific mathematical questions or problems to solve.

TYPE: NO_QUESTION