Base | Representation |
---|---|
bin | 11001011101111111011010… |
… | …101000010011011110011111 |
3 | 112200121020212020112001202102 |
4 | 121131333122220103132133 |
5 | 104140201310222023012 |
6 | 1034121354012515315 |
7 | 32410415520334334 |
oct | 3135773250233637 |
9 | 480536766461672 |
10 | 112012120111007 |
11 | 3276608971a846 |
12 | 1069084847bb3b |
13 | 4a6690b83293c |
14 | 1d935b635698b |
15 | ce3a5b7892c2 |
hex | 65dfdaa1379f |
112012120111007 has 2 divisors, whose sum is σ = 112012120111008. Its totient is φ = 112012120111006.
The previous prime is 112012120110911. The next prime is 112012120111009. The reversal of 112012120111007 is 700111021210211.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112012120111007 - 216 = 112012120045471 is a prime.
Together with 112012120111009, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112012120111007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112012120111009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56006060055503 + 56006060055504.
It is an arithmetic number, because the mean of its divisors is an integer number (56006060055504).
Almost surely, 2112012120111007 is an apocalyptic number.
112012120111007 is a deficient number, since it is larger than the sum of its proper divisors (1).
112012120111007 is an equidigital number, since it uses as much as digits as its factorization.
112012120111007 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 112012120111007 its reverse (700111021210211), we get a palindrome (812123141321218).
The spelling of 112012120111007 in words is "one hundred twelve trillion, twelve billion, one hundred twenty million, one hundred eleven thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •