Base | Representation |
---|---|
bin | 10000001011101000111… |
… | …110010001010010001111 |
3 | 10221022021220101011010122 |
4 | 100023220332101102033 |
5 | 121204344102401312 |
6 | 2210503405455155 |
7 | 143224435513334 |
oct | 20135076212217 |
9 | 3838256334118 |
10 | 1112010200207 |
11 | 39966784a195 |
12 | 15b621b714bb |
13 | 80b290a180a |
14 | 3bb705bc98b |
15 | 1ddd5088b72 |
hex | 102e8f9148f |
1112010200207 has 2 divisors, whose sum is σ = 1112010200208. Its totient is φ = 1112010200206.
The previous prime is 1112010200107. The next prime is 1112010200209. The reversal of 1112010200207 is 7020020102111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1112010200207 - 236 = 1043290723471 is a prime.
Together with 1112010200209, 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 (1112010200209) 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, 556005100103 + 556005100104.
It is an arithmetic number, because the mean of its divisors is an integer number (556005100104).
Almost surely, 21112010200207 is an apocalyptic number.
1112010200207 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112010200207 is an equidigital number, since it uses as much as digits as its factorization.
1112010200207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 1112010200207 its reverse (7020020102111), we get a palindrome (8132030302318).
The spelling of 1112010200207 in words is "one trillion, one hundred twelve billion, ten million, two hundred thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •