Base | Representation |
---|---|
bin | 101111100000001010… |
… | …1110110001011010011 |
3 | 100202022100001220021102 |
4 | 1133000111312023103 |
5 | 3132404331401321 |
6 | 114510250015015 |
7 | 10240634615654 |
oct | 1370025661323 |
9 | 322270056242 |
10 | 102011200211 |
11 | 3a298732638 |
12 | 1792b41746b |
13 | 98093a8a3b |
14 | 4d1a1d352b |
15 | 29c0ab0c0b |
hex | 17c05762d3 |
102011200211 has 2 divisors, whose sum is σ = 102011200212. Its totient is φ = 102011200210.
The previous prime is 102011200153. The next prime is 102011200217. The reversal of 102011200211 is 112002110201.
It is a strong prime.
It is an emirp because it is prime and its reverse (112002110201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102011200211 - 218 = 102010938067 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102011200192 and 102011200201.
It is not a weakly prime, because it can be changed into another prime (102011200217) 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, 51005600105 + 51005600106.
It is an arithmetic number, because the mean of its divisors is an integer number (51005600106).
Almost surely, 2102011200211 is an apocalyptic number.
102011200211 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011200211 is an equidigital number, since it uses as much as digits as its factorization.
102011200211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102011200211 its reverse (112002110201), we get a palindrome (214013310412).
The spelling of 102011200211 in words is "one hundred two billion, eleven million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •