Base | Representation |
---|---|
bin | 11001011110010001000000… |
… | …101110111101110001011011 |
3 | 112200200001121220211101102010 |
4 | 121132101000232331301123 |
5 | 104141004003312033311 |
6 | 1034134200433041003 |
7 | 32411654640300213 |
oct | 3136210056756133 |
9 | 480601556741363 |
10 | 112031013002331 |
11 | 327730a4219715 |
12 | 1069443b6b6163 |
13 | 4a6862ca3b087 |
14 | 1d944895ad243 |
15 | ce42b5217da6 |
hex | 65e440bbdc5b |
112031013002331 has 32 divisors (see below), whose sum is σ = 156440896035840. Its totient is φ = 71178351197184.
The previous prime is 112031013002317. The next prime is 112031013002371. The reversal of 112031013002331 is 133200310130211.
It is a happy number.
It is not a de Polignac number, because 112031013002331 - 221 = 112031010905179 is a prime.
It is a super-2 number, since 2×1120310130023312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112031013002298 and 112031013002307.
It is not an unprimeable number, because it can be changed into a prime (112031013002371) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31640490 + ... + 35002608.
It is an arithmetic number, because the mean of its divisors is an integer number (4888778001120).
Almost surely, 2112031013002331 is an apocalyptic number.
112031013002331 is a deficient number, since it is larger than the sum of its proper divisors (44409883033509).
112031013002331 is a wasteful number, since it uses less digits than its factorization.
112031013002331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3363915.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 112031013002331 its reverse (133200310130211), we get a palindrome (245231323132542).
The spelling of 112031013002331 in words is "one hundred twelve trillion, thirty-one billion, thirteen million, two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •