Base | Representation |
---|---|
bin | 11001011111011100100010… |
… | …010111011110111010111101 |
3 | 112200221210221120012110201102 |
4 | 121133130202113132322331 |
5 | 104143321044111040142 |
6 | 1034235331422222445 |
7 | 32420555355522023 |
oct | 3137344227367275 |
9 | 480853846173642 |
10 | 112112107908797 |
11 | 327a4529181177 |
12 | 106a80b2124a25 |
13 | 4a7318495c329 |
14 | 1d9837d91c713 |
15 | ce645e8b3532 |
hex | 65f7225deebd |
112112107908797 has 2 divisors, whose sum is σ = 112112107908798. Its totient is φ = 112112107908796.
The previous prime is 112112107908767. The next prime is 112112107908799. The reversal of 112112107908797 is 797809701211211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107407811523076 + 4704296385721 = 10363774^2 + 2168939^2 .
It is a cyclic number.
It is not a de Polignac number, because 112112107908797 - 228 = 112111839473341 is a prime.
Together with 112112107908799, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112112107908799) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56056053954398 + 56056053954399.
It is an arithmetic number, because the mean of its divisors is an integer number (56056053954399).
Almost surely, 2112112107908797 is an apocalyptic number.
It is an amenable number.
112112107908797 is a deficient number, since it is larger than the sum of its proper divisors (1).
112112107908797 is an equidigital number, since it uses as much as digits as its factorization.
112112107908797 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 889056, while the sum is 56.
The spelling of 112112107908797 in words is "one hundred twelve trillion, one hundred twelve billion, one hundred seven million, nine hundred eight thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •