## 22055

22,055 (twenty-two thousand fifty-five) is an odd five-digits composite number following 22054 and preceding 22056. In scientific notation, it is written as 2.2055 × 104. The sum of its digits is 14. It has a total of 3 prime factors and 8 positive divisors. There are 16,000 positive integers (up to 22055) that are relatively prime to 22055.

## Basic properties

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

## Name

Short name 22 thousand 55 twenty-two thousand fifty-five

## Notation

Scientific notation 2.2055 × 104 22.055 × 103

## Prime Factorization of 22055

Prime Factorization 5 × 11 × 401

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 22055 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,055 is 5 × 11 × 401. Since it has a total of 3 prime factors, 22,055 is a composite number.

## Divisors of 22055

1, 5, 11, 55, 401, 2005, 4411, 22055

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) 28944 Sum of all the positive divisors of n s(n) 6889 Sum of the proper positive divisors of n A(n) 3618 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 148.509 Returns the nth root of the product of n divisors H(n) 6.09591 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 22,055 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 22,055) is 28,944, the average is 3,618.

## Other Arithmetic Functions (n = 22055)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 16000 Total number of positive integers not greater than n that are coprime to n λ(n) 400 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 2471 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 16,000 positive integers (less than 22,055) that are coprime with 22,055. And there are approximately 2,471 prime numbers less than or equal to 22,055.

## Divisibility of 22055

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

The number 22,055 is divisible by 5.

## Classification of 22055

• Arithmetic
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael
• Sphenic

## Base conversion (22055)

Base System Value
2 Binary 101011000100111
3 Ternary 1010020212
4 Quaternary 11120213
5 Quinary 1201210
6 Senary 250035
8 Octal 53047
10 Decimal 22055
12 Duodecimal 1091b
20 Vigesimal 2f2f
36 Base36 h0n

## Basic calculations (n = 22055)

### Multiplication

n×i
 n×2 44110 66165 88220 110275

### Division

ni
 n⁄2 11027.5 7351.67 5513.75 4411

### Exponentiation

ni
 n2 486423025 10728059816375 236607359250150625 5218375308262072034375

### Nth Root

i√n
 2√n 148.509 28.0437 12.1864 7.39097

## 22055 as geometric shapes

### Circle

 Diameter 44110 138576 1.52814e+09

### Sphere

 Volume 4.49376e+13 6.11257e+09 138576

### Square

Length = n
 Perimeter 88220 4.86423e+08 31190.5

### Cube

Length = n
 Surface area 2.91854e+09 1.07281e+13 38200.4

### Equilateral Triangle

Length = n
 Perimeter 66165 2.10627e+08 19100.2

### Triangular Pyramid

Length = n
 Surface area 8.42509e+08 1.26431e+12 18007.8

## Cryptographic Hash Functions

md5 8371d58a2140475594cb7a1c22f0baaa 7734b6d92f5743a4d3d975ab407611ae87be3e2e 9422370500e717a41a6ae2819b0a82abf076db0bbda7972e4bbe63c3b2c2fe92 208d36b1991679ab3548d693043526f6d466078242339cf48c3d87c0ed8b24c27ede5b7ebdc705da90d3063941a01f6890fabce15642a6c4601c0bd63daabfd9 68b7016aa1dd14da22383c727f0b0af6b028c3a4
{"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, "url": "https://metanumbers.com/22055", "fetch_time": 1601007281000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2020-40/segments/1600400221980.49/warc/CC-MAIN-20200925021647-20200925051647-00521.warc.gz", "warc_record_offset": 504784607, "warc_record_length": 7490, "token_count": 1465, "char_count": 4118, "score": 3.890625, "int_score": 4, "crawl": "CC-MAIN-2020-40", "snapshot_type": "latest", "language": "en", "language_score": 0.8105383515357971, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00018-of-00064.parquet"}