Base | Representation |
---|---|
bin | 1110001001101101100011… |
… | …10011110111001101000011 |
3 | 11002012001012210012222212102 |
4 | 13010312301303313031003 |
5 | 13034332300413102321 |
6 | 150104201305021015 |
7 | 6361230064610045 |
oct | 704666163671503 |
9 | 132161183188772 |
10 | 31120021222211 |
11 | 9a08a21756689 |
12 | 35a732818476b |
13 | 14497b411296c |
14 | 7983078a1a95 |
15 | 38e7832d8c0b |
hex | 1c4db1cf7343 |
31120021222211 has 8 divisors (see below), whose sum is σ = 31127334013440. Its totient is φ = 31112708892232.
The previous prime is 31120021222193. The next prime is 31120021222229. The reversal of 31120021222211 is 11222212002113.
It is an interprime number because it is at equal distance from previous prime (31120021222193) and next prime (31120021222229).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31120021222211 - 222 = 31120017027907 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31120021222811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 160561586 + ... + 160755288.
It is an arithmetic number, because the mean of its divisors is an integer number (3890916751680).
Almost surely, 231120021222211 is an apocalyptic number.
31120021222211 is a deficient number, since it is larger than the sum of its proper divisors (7312791229).
31120021222211 is a wasteful number, since it uses less digits than its factorization.
31120021222211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230625.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 31120021222211 its reverse (11222212002113), we get a palindrome (42342233224324).
The spelling of 31120021222211 in words is "thirty-one trillion, one hundred twenty billion, twenty-one million, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •