Base | Representation |
---|---|
bin | 101111100000001010… |
… | …1100000011100110011 |
3 | 100202022022220101012102 |
4 | 1133000111200130303 |
5 | 3132404321024334 |
6 | 114510244051015 |
7 | 10240634065343 |
oct | 1370025403463 |
9 | 322268811172 |
10 | 102011111219 |
11 | 3a298681796 |
12 | 1792b393a6b |
13 | 9809377394 |
14 | 4d1a1acd23 |
15 | 29c0a9467e |
hex | 17c0560733 |
102011111219 has 2 divisors, whose sum is σ = 102011111220. Its totient is φ = 102011111218.
The previous prime is 102011111171. The next prime is 102011111221. The reversal of 102011111219 is 912111110201.
It is a strong prime.
It is an emirp because it is prime and its reverse (912111110201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102011111219 - 28 = 102011110963 is a prime.
It is a super-2 number, since 2×1020111112192 (a number of 23 digits) contains 22 as substring.
Together with 102011111221, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102011111219.
It is not a weakly prime, because it can be changed into another prime (102011111249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005555609 + 51005555610.
It is an arithmetic number, because the mean of its divisors is an integer number (51005555610).
Almost surely, 2102011111219 is an apocalyptic number.
102011111219 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011111219 is an equidigital number, since it uses as much as digits as its factorization.
102011111219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 102011111219 in words is "one hundred two billion, eleven million, one hundred eleven thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •