Base | Representation |
---|---|
bin | 11001011101111111011001… |
… | …011100011000000101001111 |
3 | 112200121020210212001211111021 |
4 | 121131333121130120011033 |
5 | 104140201240123110202 |
6 | 1034121352022135011 |
7 | 32410415156215054 |
oct | 3135773134300517 |
9 | 480536725054437 |
10 | 112012100206927 |
11 | 32766079465598 |
12 | 10690841881467 |
13 | 4a6690768408b |
14 | 1d935b385502b |
15 | ce3a59b56a37 |
hex | 65dfd971814f |
112012100206927 has 2 divisors, whose sum is σ = 112012100206928. Its totient is φ = 112012100206926.
The previous prime is 112012100206907. The next prime is 112012100206931. The reversal of 112012100206927 is 729602001210211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112012100206927 - 215 = 112012100174159 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112012100206892 and 112012100206901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112012100206907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56006050103463 + 56006050103464.
It is an arithmetic number, because the mean of its divisors is an integer number (56006050103464).
Almost surely, 2112012100206927 is an apocalyptic number.
112012100206927 is a deficient number, since it is larger than the sum of its proper divisors (1).
112012100206927 is an equidigital number, since it uses as much as digits as its factorization.
112012100206927 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 34.
The spelling of 112012100206927 in words is "one hundred twelve trillion, twelve billion, one hundred million, two hundred six thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •