Base | Representation |
---|---|
bin | 11001011111010011001001… |
… | …101111101000001010111011 |
3 | 112200220211221021222010200220 |
4 | 121133103021233220022323 |
5 | 104143134424432200243 |
6 | 1034230543454031123 |
7 | 32420050556365032 |
oct | 3137231157501273 |
9 | 480824837863626 |
10 | 112102031131323 |
11 | 327a0228097102 |
12 | 106a615b4a84a3 |
13 | 4a7223a09c4cc |
14 | 1d97aa54d1719 |
15 | ce606eddb783 |
hex | 65f4c9be82bb |
112102031131323 has 16 divisors (see below), whose sum is σ = 149786478654720. Its totient is φ = 74576156387616.
The previous prime is 112102031131309. The next prime is 112102031131367. The reversal of 112102031131323 is 323131130201211.
It is not a de Polignac number, because 112102031131323 - 224 = 112102014354107 is a prime.
It is a super-2 number, since 2×1121020311313232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112102031131293 and 112102031131302.
It is not an unprimeable number, because it can be changed into a prime (112102031131823) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18943833 + ... + 24146901.
It is an arithmetic number, because the mean of its divisors is an integer number (9361654915920).
Almost surely, 2112102031131323 is an apocalyptic number.
112102031131323 is a deficient number, since it is larger than the sum of its proper divisors (37684447523397).
112102031131323 is a wasteful number, since it uses less digits than its factorization.
112102031131323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5218306.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 112102031131323 its reverse (323131130201211), we get a palindrome (435233161332534).
The spelling of 112102031131323 in words is "one hundred twelve trillion, one hundred two billion, thirty-one million, one hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •