Base | Representation |
---|---|
bin | 1001001100100110111000… |
… | …0101110100001110111011 |
3 | 1022210201100121101111101222 |
4 | 2103021232011310032323 |
5 | 2311134241202030321 |
6 | 33301251445102255 |
7 | 2062403513032613 |
oct | 223115605641673 |
9 | 38721317344358 |
10 | 10112200033211 |
11 | 32496183266a1 |
12 | 117398b3b798b |
13 | 584765398c13 |
14 | 26d60c59ba43 |
15 | 1280952623ab |
hex | 9326e1743bb |
10112200033211 has 2 divisors, whose sum is σ = 10112200033212. Its totient is φ = 10112200033210.
The previous prime is 10112200033183. The next prime is 10112200033283. The reversal of 10112200033211 is 11233000221101.
It is a weak prime.
It is an emirp because it is prime and its reverse (11233000221101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10112200033211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10112200033211.
It is not a weakly prime, because it can be changed into another prime (10112200033711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056100016605 + 5056100016606.
It is an arithmetic number, because the mean of its divisors is an integer number (5056100016606).
Almost surely, 210112200033211 is an apocalyptic number.
10112200033211 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112200033211 is an equidigital number, since it uses as much as digits as its factorization.
10112200033211 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 17.
Adding to 10112200033211 its reverse (11233000221101), we get a palindrome (21345200254312).
The spelling of 10112200033211 in words is "ten trillion, one hundred twelve billion, two hundred million, thirty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •