Base | Representation |
---|---|
bin | 101110111001000000110… |
… | …001010001101000111010 |
3 | 102102001100110202122211120 |
4 | 232321000301101220322 |
5 | 410243243401144010 |
6 | 10504150524010110 |
7 | 451542620123061 |
oct | 56710061215072 |
9 | 12361313678746 |
10 | 3222312131130 |
11 | 1032636213274 |
12 | 440609990936 |
13 | 1a4b2a558721 |
14 | b1d643a91d8 |
15 | 58c468eee70 |
hex | 2ee40c51a3a |
3222312131130 has 32 divisors (see below), whose sum is σ = 7782807400704. Its totient is φ = 853810092096.
The previous prime is 3222312131111. The next prime is 3222312131153. The reversal of 3222312131130 is 311312132223.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 3222312131130.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 342066642 + ... + 342076061.
It is an arithmetic number, because the mean of its divisors is an integer number (243212731272).
Almost surely, 23222312131130 is an apocalyptic number.
3222312131130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3222312131130 is an abundant number, since it is smaller than the sum of its proper divisors (4560495269574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3222312131130 is a wasteful number, since it uses less digits than its factorization.
3222312131130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 684142870.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 3222312131130 its reverse (311312132223), we get a palindrome (3533624263353).
The spelling of 3222312131130 in words is "three trillion, two hundred twenty-two billion, three hundred twelve million, one hundred thirty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •