Base | Representation |
---|---|
bin | 10111001100011101010000… |
… | …101000101110110110001111 |
3 | 111101012011112102110220111201 |
4 | 113030131100220232312033 |
5 | 101332322234000232343 |
6 | 1000543132335330331 |
7 | 30326026451355004 |
oct | 2714352050566617 |
9 | 441164472426451 |
10 | 102011121102223 |
11 | 2a55a74548a733 |
12 | b5365320809a7 |
13 | 44bc7b8726478 |
14 | 1b295166978ab |
15 | bbd823cad94d |
hex | 5cc750a2ed8f |
102011121102223 has 2 divisors, whose sum is σ = 102011121102224. Its totient is φ = 102011121102222.
The previous prime is 102011121102179. The next prime is 102011121102229. The reversal of 102011121102223 is 322201121110201.
It is a strong prime.
It is an emirp because it is prime and its reverse (322201121110201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102011121102223 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102011121102223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102011121102229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005560551111 + 51005560551112.
It is an arithmetic number, because the mean of its divisors is an integer number (51005560551112).
Almost surely, 2102011121102223 is an apocalyptic number.
102011121102223 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011121102223 is an equidigital number, since it uses as much as digits as its factorization.
102011121102223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 102011121102223 its reverse (322201121110201), we get a palindrome (424212242212424).
The spelling of 102011121102223 in words is "one hundred two trillion, eleven billion, one hundred twenty-one million, one hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •