Base | Representation |
---|---|
bin | 1001001101001011011001… |
… | …0101101111101000100011 |
3 | 1022211122122201201020002002 |
4 | 2103102312111233220203 |
5 | 2311314330014242234 |
6 | 33305552241314215 |
7 | 2063201435200205 |
oct | 223226625575043 |
9 | 38748581636062 |
10 | 10122002102819 |
11 | 3252798341672 |
12 | 117586603596b |
13 | 5856680750c9 |
14 | 26dc9c31a775 |
15 | 12846aa7427e |
hex | 934b656fa23 |
10122002102819 has 2 divisors, whose sum is σ = 10122002102820. Its totient is φ = 10122002102818.
The previous prime is 10122002102813. The next prime is 10122002102833. The reversal of 10122002102819 is 91820120022101.
It is a weak prime.
It is an emirp because it is prime and its reverse (91820120022101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10122002102819 - 228 = 10121733667363 is a prime.
It is a super-2 number, since 2×101220021028192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10122002102791 and 10122002102800.
It is not a weakly prime, because it can be changed into another prime (10122002102813) 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, 5061001051409 + 5061001051410.
It is an arithmetic number, because the mean of its divisors is an integer number (5061001051410).
Almost surely, 210122002102819 is an apocalyptic number.
10122002102819 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122002102819 is an equidigital number, since it uses as much as digits as its factorization.
10122002102819 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 29.
The spelling of 10122002102819 in words is "ten trillion, one hundred twenty-two billion, two million, one hundred two thousand, eight hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •