Base | Representation |
---|---|
bin | 1010000110000111000110… |
… | …00110100000110011101010 |
3 | 2220121022121012001001021020 |
4 | 11003003203012200303222 |
5 | 10402212002441333002 |
6 | 115114344231553310 |
7 | 4450624452000402 |
oct | 503034306406352 |
9 | 86538535031236 |
10 | 22200201121002 |
11 | 708a063858223 |
12 | 25a666a52b836 |
13 | c50615724888 |
14 | 56a6d17c3802 |
15 | 287728cb42bc |
hex | 1430e31a0cea |
22200201121002 has 8 divisors (see below), whose sum is σ = 44400402242016. Its totient is φ = 7400067040332.
The previous prime is 22200201121001. The next prime is 22200201121039. The reversal of 22200201121002 is 20012110200222.
It is a sphenic number, since it is the product of 3 distinct primes.
22200201121002 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (22200201121001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1850016760078 + ... + 1850016760089.
It is an arithmetic number, because the mean of its divisors is an integer number (5550050280252).
Almost surely, 222200201121002 is an apocalyptic number.
22200201121002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22200201121002 is a wasteful number, since it uses less digits than its factorization.
22200201121002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3700033520172.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 22200201121002 its reverse (20012110200222), we get a palindrome (42212311321224).
The spelling of 22200201121002 in words is "twenty-two trillion, two hundred billion, two hundred one million, one hundred twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •