Base | Representation |
---|---|
bin | 11001011101111101011101… |
… | …011101110010001010000011 |
3 | 112200121001102220011120220002 |
4 | 121131331131131302022003 |
5 | 104140133010132413331 |
6 | 1034120405400310215 |
7 | 32410312501364105 |
oct | 3135753535621203 |
9 | 480531386146802 |
10 | 112010020201091 |
11 | 32765201343401 |
12 | 1069036117236b |
13 | 4a66665776aac |
14 | 1d934574d1575 |
15 | ce398723d9cb |
hex | 65df5d772283 |
112010020201091 has 2 divisors, whose sum is σ = 112010020201092. Its totient is φ = 112010020201090.
The previous prime is 112010020201049. The next prime is 112010020201111. The reversal of 112010020201091 is 190102020010211.
It is an a-pointer prime, because the next prime (112010020201111) can be obtained adding 112010020201091 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112010020201091 - 238 = 111735142294147 is a prime.
It is not a weakly prime, because it can be changed into another prime (112010020201591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56005010100545 + 56005010100546.
It is an arithmetic number, because the mean of its divisors is an integer number (56005010100546).
Almost surely, 2112010020201091 is an apocalyptic number.
112010020201091 is a deficient number, since it is larger than the sum of its proper divisors (1).
112010020201091 is an equidigital number, since it uses as much as digits as its factorization.
112010020201091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 112010020201091 in words is "one hundred twelve trillion, ten billion, twenty million, two hundred one thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •