Base | Representation |
---|---|
bin | 1010000000010100000110… |
… | …00110111001000101111000 |
3 | 2212220021111001121000212021 |
4 | 11000022003012321011320 |
5 | 10340431043130041440 |
6 | 114443044030324224 |
7 | 4430343560234452 |
oct | 500120306710570 |
9 | 85807431530767 |
10 | 22001022112120 |
11 | 7012643464887 |
12 | 2573b41959674 |
13 | c378c2527b7c |
14 | 560bd87732d2 |
15 | 28246c96184a |
hex | 1402831b9178 |
22001022112120 has 32 divisors (see below), whose sum is σ = 50241140053200. Its totient is φ = 8669059458048.
The previous prime is 22001022112109. The next prime is 22001022112133. The reversal of 22001022112120 is 2121122010022.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 22001022112094 and 22001022112103.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 4104665625 + ... + 4104670984.
Almost surely, 222001022112120 is an apocalyptic number.
22001022112120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22001022112120 is an abundant number, since it is smaller than the sum of its proper divisors (28240117941080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22001022112120 is a wasteful number, since it uses less digits than its factorization.
22001022112120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8209336687 (or 8209336683 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22001022112120 its reverse (2121122010022), we get a palindrome (24122144122142).
The spelling of 22001022112120 in words is "twenty-two trillion, one billion, twenty-two million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •