Base | Representation |
---|---|
bin | 110100001101011101… |
… | …0001001010110110101 |
3 | 101201101212200121200102 |
4 | 1220122322021112311 |
5 | 3314110333144424 |
6 | 123301341323445 |
7 | 11046311242466 |
oct | 1503272112665 |
9 | 351355617612 |
10 | 112120599989 |
11 | 43606179292 |
12 | 19890b66585 |
13 | a75a94b2b8 |
14 | 55d8ab2d6d |
15 | 2db337d7ae |
hex | 1a1ae895b5 |
112120599989 has 2 divisors, whose sum is σ = 112120599990. Its totient is φ = 112120599988.
The previous prime is 112120599937. The next prime is 112120600001. The reversal of 112120599989 is 989995021211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86779143889 + 25341456100 = 294583^2 + 159190^2 .
It is a cyclic number.
It is not a de Polignac number, because 112120599989 - 212 = 112120595893 is a prime.
It is a super-3 number, since 3×1121205999893 (a number of 34 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112120599889) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56060299994 + 56060299995.
It is an arithmetic number, because the mean of its divisors is an integer number (56060299995).
Almost surely, 2112120599989 is an apocalyptic number.
It is an amenable number.
112120599989 is a deficient number, since it is larger than the sum of its proper divisors (1).
112120599989 is an equidigital number, since it uses as much as digits as its factorization.
112120599989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1049760, while the sum is 56.
The spelling of 112120599989 in words is "one hundred twelve billion, one hundred twenty million, five hundred ninety-nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •