Base | Representation |
---|---|
bin | 1010000110011101010011… |
… | …01001100001000000001010 |
3 | 2220122110100222111112220010 |
4 | 11003032221221201000022 |
5 | 10402410411230321302 |
6 | 115124035200212350 |
7 | 4451526043552200 |
oct | 503165151410012 |
9 | 86573328445803 |
10 | 22212122120202 |
11 | 7094120960383 |
12 | 25a8a3690a0b6 |
13 | c517953b8a61 |
14 | 56b102b19070 |
15 | 287bc562c16c |
hex | 1433a9a6100a |
22212122120202 has 96 divisors (see below), whose sum is σ = 54730760140800. Its totient is φ = 5975418187872.
The previous prime is 22212122120191. The next prime is 22212122120203. The reversal of 22212122120202 is 20202122121222.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (22212122120203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11287002 + ... + 13108037.
It is an arithmetic number, because the mean of its divisors is an integer number (570112084800).
Almost surely, 222212122120202 is an apocalyptic number.
22212122120202 is an abundant number, since it is smaller than the sum of its proper divisors (32518638020598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22212122120202 is a wasteful number, since it uses less digits than its factorization.
22212122120202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24395240 (or 24395233 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 22212122120202 its reverse (20202122121222), we get a palindrome (42414244241424).
The spelling of 22212122120202 in words is "twenty-two trillion, two hundred twelve billion, one hundred twenty-two million, one hundred twenty thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •