## 21982

21,982 (twenty-one thousand nine hundred eighty-two) is an even five-digits composite number following 21981 and preceding 21983. In scientific notation, it is written as 2.1982 × 104. The sum of its digits is 22. It has a total of 3 prime factors and 8 positive divisors. There are 10,584 positive integers (up to 21982) that are relatively prime to 21982.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 5
• Sum of Digits 22
• Digital Root 4

## Name

Short name 21 thousand 982 twenty-one thousand nine hundred eighty-two

## Notation

Scientific notation 2.1982 × 104 21.982 × 103

## Prime Factorization of 21982

Prime Factorization 2 × 29 × 379

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 21982 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 21,982 is 2 × 29 × 379. Since it has a total of 3 prime factors, 21,982 is a composite number.

## Divisors of 21982

1, 2, 29, 58, 379, 758, 10991, 21982

8 divisors

 Even divisors 4 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 34200 Sum of all the positive divisors of n s(n) 12218 Sum of the proper positive divisors of n A(n) 4275 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 148.263 Returns the nth root of the product of n divisors H(n) 5.14199 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 21,982 can be divided by 8 positive divisors (out of which 4 are even, and 4 are odd). The sum of these divisors (counting 21,982) is 34,200, the average is 4,275.

## Other Arithmetic Functions (n = 21982)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 10584 Total number of positive integers not greater than n that are coprime to n λ(n) 756 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 2464 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 10,584 positive integers (less than 21,982) that are coprime with 21,982. And there are approximately 2,464 prime numbers less than or equal to 21,982.

## Divisibility of 21982

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

The number 21,982 is divisible by 2.

• Arithmetic
• Deficient

• Polite

• Square Free

• Sphenic

## Base conversion (21982)

Base System Value
2 Binary 101010111011110
3 Ternary 1010011011
4 Quaternary 11113132
5 Quinary 1200412
6 Senary 245434
8 Octal 52736
10 Decimal 21982
12 Duodecimal 1087a
20 Vigesimal 2ej2
36 Base36 gym

## Basic calculations (n = 21982)

### Multiplication

n×i
 n×2 43964 65946 87928 109910

### Division

ni
 n⁄2 10991 7327.33 5495.5 4396.4

### Exponentiation

ni
 n2 483208324 10621885378168 233490284382888976 5132583431304665470432

### Nth Root

i√n
 2√n 148.263 28.0127 12.1763 7.38607

## 21982 as geometric shapes

### Circle

 Diameter 43964 138117 1.51804e+09

### Sphere

 Volume 4.44928e+13 6.07217e+09 138117

### Square

Length = n
 Perimeter 87928 4.83208e+08 31087.2

### Cube

Length = n
 Surface area 2.89925e+09 1.06219e+13 38073.9

### Equilateral Triangle

Length = n
 Perimeter 65946 2.09235e+08 19037

### Triangular Pyramid

Length = n
 Surface area 8.36941e+08 1.2518e+12 17948.2

## Cryptographic Hash Functions

md5 f997c52f51d33af5ee690d9455bb6a90 41509cc756647584cf160813d8198b7d19c072fd 50841fcd1e4300cfcc5dbeabe8232cf16982a07749ca53b067cf28822d254d6c 7a4a6db2159ba5c143403cbe408ef0c459fd2b074dc324ad315d397c590611b92107e15c57f52a8649e683f67486a34c6d0178e69537d08ce858edffff2261a2 cce3cfa7fa000749eac53898d5a81604d593c95f
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}