Base | Representation |
---|---|
bin | 101111100010110100… |
… | …1000000111010101011 |
3 | 100202112112101000222022 |
4 | 1133011221000322223 |
5 | 3133100112023034 |
6 | 114523143415055 |
7 | 10243064424104 |
oct | 1370551007253 |
9 | 322475330868 |
10 | 102100111019 |
11 | 3a33393a645 |
12 | 1795515448b |
13 | 9821938c9a |
14 | 4d27d393ab |
15 | 29c87c4b2e |
hex | 17c5a40eab |
102100111019 has 2 divisors, whose sum is σ = 102100111020. Its totient is φ = 102100111018.
The previous prime is 102100111013. The next prime is 102100111021. The reversal of 102100111019 is 910111001201.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (910111001201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102100111019 is a prime.
It is a super-2 number, since 2×1021001110192 (a number of 23 digits) contains 22 as substring.
Together with 102100111021, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 102100110988 and 102100111006.
It is not a weakly prime, because it can be changed into another prime (102100111013) 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, 51050055509 + 51050055510.
It is an arithmetic number, because the mean of its divisors is an integer number (51050055510).
Almost surely, 2102100111019 is an apocalyptic number.
102100111019 is a deficient number, since it is larger than the sum of its proper divisors (1).
102100111019 is an equidigital number, since it uses as much as digits as its factorization.
102100111019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 17.
The spelling of 102100111019 in words is "one hundred two billion, one hundred million, one hundred eleven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •