Base | Representation |
---|---|
bin | 1001000110001100110000… |
… | …1110011011101010111011 |
3 | 1022102012012020221112201201 |
4 | 2101203030032123222323 |
5 | 2302333310202404012 |
6 | 33134523405555031 |
7 | 2051425420634335 |
oct | 221431416335273 |
9 | 38365166845651 |
10 | 10002110200507 |
11 | 32069644a9987 |
12 | 1156586575a77 |
13 | 57726c3a8289 |
14 | 2681674b2455 |
15 | 1252a0322857 |
hex | 918cc39babb |
10002110200507 has 2 divisors, whose sum is σ = 10002110200508. Its totient is φ = 10002110200506.
The previous prime is 10002110200501. The next prime is 10002110200513. The reversal of 10002110200507 is 70500201120001.
It is a balanced prime because it is at equal distance from previous prime (10002110200501) and next prime (10002110200513).
It is an emirp because it is prime and its reverse (70500201120001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10002110200507 - 231 = 9999962716859 is a prime.
It is not a weakly prime, because it can be changed into another prime (10002110200501) 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, 5001055100253 + 5001055100254.
It is an arithmetic number, because the mean of its divisors is an integer number (5001055100254).
Almost surely, 210002110200507 is an apocalyptic number.
10002110200507 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002110200507 is an equidigital number, since it uses as much as digits as its factorization.
10002110200507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 19.
Adding to 10002110200507 its reverse (70500201120001), we get a palindrome (80502311320508).
The spelling of 10002110200507 in words is "ten trillion, two billion, one hundred ten million, two hundred thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •