Base | Representation |
---|---|
bin | 10011000000000100… |
… | …01001010111100011 |
3 | 222022221012002011102 |
4 | 21200002021113203 |
5 | 131342441004422 |
6 | 4404125105015 |
7 | 510536001305 |
oct | 114002112743 |
9 | 28287162142 |
10 | 10201109987 |
11 | 4365295a12 |
12 | 1b883b816b |
13 | c67572a73 |
14 | 6cab53975 |
15 | 3ea886192 |
hex | 2600895e3 |
10201109987 has 2 divisors, whose sum is σ = 10201109988. Its totient is φ = 10201109986.
The previous prime is 10201109959. The next prime is 10201109999. The reversal of 10201109987 is 78990110201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10201109987 - 214 = 10201093603 is a prime.
It is a super-2 number, since 2×102011099872 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10201109987.
It is not a weakly prime, because it can be changed into another prime (10201109287) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100554993 + 5100554994.
It is an arithmetic number, because the mean of its divisors is an integer number (5100554994).
Almost surely, 210201109987 is an apocalyptic number.
10201109987 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201109987 is an equidigital number, since it uses as much as digits as its factorization.
10201109987 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 38.
The spelling of 10201109987 in words is "ten billion, two hundred one million, one hundred nine thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •