Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …0100110000111010000011 |
3 | 1022202112220010210001011021 |
4 | 2102332113210300322003 |
5 | 2310434310321010034 |
6 | 33251514150130311 |
7 | 2061462455634445 |
oct | 222762744607203 |
9 | 38675803701137 |
10 | 10100011110019 |
11 | 3244432a68256 |
12 | 1171549350997 |
13 | 583572057b2c |
14 | 26cbb3842495 |
15 | 127ad01246b4 |
hex | 92f97930e83 |
10100011110019 has 2 divisors, whose sum is σ = 10100011110020. Its totient is φ = 10100011110018.
The previous prime is 10100011109999. The next prime is 10100011110053. The reversal of 10100011110019 is 91001111000101.
10100011110019 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (91001111000101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10100011110019 - 27 = 10100011109891 is a prime.
It is a super-2 number, since 2×101000111100192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10100011109984 and 10100011110011.
It is not a weakly prime, because it can be changed into another prime (10100011110089) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050005555009 + 5050005555010.
It is an arithmetic number, because the mean of its divisors is an integer number (5050005555010).
Almost surely, 210100011110019 is an apocalyptic number.
10100011110019 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100011110019 is an equidigital number, since it uses as much as digits as its factorization.
10100011110019 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 10100011110019 in words is "ten trillion, one hundred billion, eleven million, one hundred ten thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •