Base | Representation |
---|---|
bin | 1010000000010100011111… |
… | …00000110011101001000010 |
3 | 2212220022000120012121211210 |
4 | 11000022033200303221002 |
5 | 10340432004414412010 |
6 | 114443120423150550 |
7 | 4430351665231362 |
oct | 500121740635102 |
9 | 85808016177753 |
10 | 22001230232130 |
11 | 701273a993496 |
12 | 2573b9b5a5456 |
13 | c379266960c6 |
14 | 560c1826a9a2 |
15 | 282480d71b20 |
hex | 14028f833a42 |
22001230232130 has 16 divisors (see below), whose sum is σ = 52802952557184. Its totient is φ = 5866994728560.
The previous prime is 22001230232117. The next prime is 22001230232207. The reversal of 22001230232130 is 3123203210022.
It is a happy number.
It is a super-3 number, since 3×220012302321303 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22001230232097 and 22001230232106.
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, 366687170506 + ... + 366687170565.
It is an arithmetic number, because the mean of its divisors is an integer number (3300184534824).
Almost surely, 222001230232130 is an apocalyptic number.
22001230232130 is an abundant number, since it is smaller than the sum of its proper divisors (30801722325054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22001230232130 is a wasteful number, since it uses less digits than its factorization.
22001230232130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 733374341081.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 22001230232130 its reverse (3123203210022), we get a palindrome (25124433442152).
The spelling of 22001230232130 in words is "twenty-two trillion, one billion, two hundred thirty million, two hundred thirty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •