Base | Representation |
---|---|
bin | 1110001001011110101001… |
… | …00000011111111101011001 |
3 | 11002011021112201010012102202 |
4 | 13010233110200133331121 |
5 | 13034214400413223413 |
6 | 150100354525535545 |
7 | 6360524460430103 |
oct | 704572440377531 |
9 | 132137481105382 |
10 | 31112013414233 |
11 | 9a05592535a64 |
12 | 35a58724145b5 |
13 | 1448b0909794b |
14 | 797b88164573 |
15 | 38e465299e58 |
hex | 1c4bd481ff59 |
31112013414233 has 8 divisors (see below), whose sum is σ = 32116092923136. Its totient is φ = 30107963041200.
The previous prime is 31112013414221. The next prime is 31112013414259. The reversal of 31112013414233 is 33241431021113.
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 31112013414233 - 216 = 31112013348697 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31112013414196 and 31112013414205.
It is not an unprimeable number, because it can be changed into a prime (31112013414733) 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, 5103491 + ... + 9395192.
It is an arithmetic number, because the mean of its divisors is an integer number (4014511615392).
Almost surely, 231112013414233 is an apocalyptic number.
It is an amenable number.
31112013414233 is a deficient number, since it is larger than the sum of its proper divisors (1004079508903).
31112013414233 is a wasteful number, since it uses less digits than its factorization.
31112013414233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14567935.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 31112013414233 its reverse (33241431021113), we get a palindrome (64353444435346).
The spelling of 31112013414233 in words is "thirty-one trillion, one hundred twelve billion, thirteen million, four hundred fourteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •