Base | Representation |
---|---|
bin | 110100001101001001… |
… | …0011110010111001101 |
3 | 101201101011010020221121 |
4 | 1220122102132113031 |
5 | 3314100202402034 |
6 | 123300330400541 |
7 | 11046123656554 |
oct | 1503222362715 |
9 | 351334106847 |
10 | 112110200269 |
11 | 43600315881 |
12 | 19889590151 |
13 | a758749812 |
14 | 55d7566d9b |
15 | 2db24c71b4 |
hex | 1a1a49e5cd |
112110200269 has 2 divisors, whose sum is σ = 112110200270. Its totient is φ = 112110200268.
The previous prime is 112110200231. The next prime is 112110200297. The reversal of 112110200269 is 962002011211.
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., 90438532900 + 21671667369 = 300730^2 + 147213^2 .
It is an emirp because it is prime and its reverse (962002011211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112110200269 - 29 = 112110199757 is a prime.
It is a super-2 number, since 2×1121102002692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112110200369) 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, 56055100134 + 56055100135.
It is an arithmetic number, because the mean of its divisors is an integer number (56055100135).
Almost surely, 2112110200269 is an apocalyptic number.
It is an amenable number.
112110200269 is a deficient number, since it is larger than the sum of its proper divisors (1).
112110200269 is an equidigital number, since it uses as much as digits as its factorization.
112110200269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 112110200269 in words is "one hundred twelve billion, one hundred ten million, two hundred thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •