Base | Representation |
---|---|
bin | 1010000000010100010000… |
… | …11010010111001000111100 |
3 | 2212220021201021001012001012 |
4 | 11000022020122113020330 |
5 | 10340431233420231022 |
6 | 114443100525534352 |
7 | 4430346020522300 |
oct | 500121032271074 |
9 | 85807637035035 |
10 | 22001111102012 |
11 | 7012689716249 |
12 | 2573b677143b8 |
13 | c37907ab5103 |
14 | 560c064d9d00 |
15 | 28247568dde2 |
hex | 14028869723c |
22001111102012 has 36 divisors (see below), whose sum is σ = 45522205314264. Its totient is φ = 9274473059040.
The previous prime is 22001111102011. The next prime is 22001111102021. The reversal of 22001111102012 is 21020111110022.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22001111102011) 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 11 ways as a sum of consecutive naturals, for example, 920074658 + ... + 920098569.
It is an arithmetic number, because the mean of its divisors is an integer number (1264505703174).
Almost surely, 222001111102012 is an apocalyptic number.
It is an amenable number.
22001111102012 is an abundant number, since it is smaller than the sum of its proper divisors (23521094212252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22001111102012 is a wasteful number, since it uses less digits than its factorization.
22001111102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1840173306 (or 1840173297 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 22001111102012 its reverse (21020111110022), we get a palindrome (43021222212034).
The spelling of 22001111102012 in words is "twenty-two trillion, one billion, one hundred eleven million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •