# 22421 (number)

22,421 (twenty-two thousand four hundred twenty-one) is an odd five-digits composite number following 22420 and preceding 22422. In scientific notation, it is written as 2.2421 × 104. The sum of its digits is 11. It has a total of 2 prime factors and 4 positive divisors. There are 19,212 positive integers (up to 22421) that are relatively prime to 22421.

## Basic properties

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

## Name

Short name 22 thousand 421 twenty-two thousand four hundred twenty-one

## Notation

Scientific notation 2.2421 × 104 22.421 × 103

## Prime Factorization of 22421

Prime Factorization 7 × 3203

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 22421 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 22,421 is 7 × 3203. Since it has a total of 2 prime factors, 22,421 is a composite number.

## Divisors of 22421

1, 7, 3203, 22421

4 divisors

 Even divisors 0 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 25632 Sum of all the positive divisors of n s(n) 3211 Sum of the proper positive divisors of n A(n) 6408 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 149.736 Returns the nth root of the product of n divisors H(n) 3.49891 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 22,421 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 22,421) is 25,632, the average is 6,408.

## Other Arithmetic Functions (n = 22421)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 19212 Total number of positive integers not greater than n that are coprime to n λ(n) 9606 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 2508 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 19,212 positive integers (less than 22,421) that are coprime with 22,421. And there are approximately 2,508 prime numbers less than or equal to 22,421.

## Divisibility of 22421

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

The number 22,421 is divisible by 7.

## Classification of 22421

• Arithmetic
• Semiprime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (22421)

Base System Value
2 Binary 101011110010101
3 Ternary 1010202102
4 Quaternary 11132111
5 Quinary 1204141
6 Senary 251445
8 Octal 53625
10 Decimal 22421
12 Duodecimal 10b85
20 Vigesimal 2g11
36 Base36 hat

## Basic calculations (n = 22421)

### Multiplication

n×y
 n×2 44842 67263 89684 112105

### Division

n÷y
 n÷2 11210.5 7473.67 5605.25 4484.2

### Exponentiation

ny
 n2 502701241 11271064524461 252708537702940081 5665978123837619556101

### Nth Root

y√n
 2√n 149.736 28.198 12.2367 7.41534

## 22421 as geometric shapes

### Circle

 Diameter 44842 140875 1.57928e+09

### Sphere

 Volume 4.72121e+13 6.31713e+09 140875

### Square

Length = n
 Perimeter 89684 5.02701e+08 31708.1

### Cube

Length = n
 Surface area 3.01621e+09 1.12711e+13 38834.3

### Equilateral Triangle

Length = n
 Perimeter 67263 2.17676e+08 19417.2

### Triangular Pyramid

Length = n
 Surface area 8.70704e+08 1.32831e+12 18306.7

## Cryptographic Hash Functions

md5 9c9050ce6b23581dbe705de1479791c0 30c2a1c65982b3dbfe029245d4158c35b527c79f 974e6b5500ae9b4146cb8e895b229e86fc4ab889842aa3f9c6c3f8b618b31f2b 1918e2c3d84b90231d6ef773dfa4d27bfffdc9430cf650ca2bc7ad82cff296d243140d6ea195e98066bcb1434f9d49ea673dea7211ced8f815afba0937c719ce f4cca44439689960da021c30b762d3700bd9e0e8
{"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}