Base | Representation |
---|---|
bin | 110100001100111001… |
… | …0111001011100101111 |
3 | 101201100120112201010112 |
4 | 1220121302321130233 |
5 | 3314041043010412 |
6 | 123255433130235 |
7 | 11045663422463 |
oct | 1503162713457 |
9 | 351316481115 |
10 | 112101922607 |
11 | 435a6681734 |
12 | 1988685997b |
13 | a756b0bbac |
14 | 55d64104a3 |
15 | 2db18de722 |
hex | 1a19cb972f |
112101922607 has 2 divisors, whose sum is σ = 112101922608. Its totient is φ = 112101922606.
The previous prime is 112101922589. The next prime is 112101922609. The reversal of 112101922607 is 706229101211.
It is a strong prime.
It is an emirp because it is prime and its reverse (706229101211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112101922607 - 236 = 43382445871 is a prime.
Together with 112101922609, 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 (112101922609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56050961303 + 56050961304.
It is an arithmetic number, because the mean of its divisors is an integer number (56050961304).
Almost surely, 2112101922607 is an apocalyptic number.
112101922607 is a deficient number, since it is larger than the sum of its proper divisors (1).
112101922607 is an equidigital number, since it uses as much as digits as its factorization.
112101922607 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 32.
The spelling of 112101922607 in words is "one hundred twelve billion, one hundred one million, nine hundred twenty-two thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •