Base | Representation |
---|---|
bin | 101110100001010011… |
… | …1111011001100001001 |
3 | 100112212100020221101221 |
4 | 1131002213323030021 |
5 | 3114044403310441 |
6 | 113521102442041 |
7 | 10134444034504 |
oct | 1350247731411 |
9 | 315770227357 |
10 | 99902010121 |
11 | 39406097931 |
12 | 17440b93321 |
13 | 9561420b74 |
14 | 4b9a03413b |
15 | 28ea8308d1 |
hex | 17429fb309 |
99902010121 has 2 divisors, whose sum is σ = 99902010122. Its totient is φ = 99902010120.
The previous prime is 99902010119. The next prime is 99902010137. The reversal of 99902010121 is 12101020999.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99344105721 + 557904400 = 315189^2 + 23620^2 .
It is a cyclic number.
It is not a de Polignac number, because 99902010121 - 21 = 99902010119 is a prime.
Together with 99902010119, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (99902010181) 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, 49951005060 + 49951005061.
It is an arithmetic number, because the mean of its divisors is an integer number (49951005061).
Almost surely, 299902010121 is an apocalyptic number.
It is an amenable number.
99902010121 is a deficient number, since it is larger than the sum of its proper divisors (1).
99902010121 is an equidigital number, since it uses as much as digits as its factorization.
99902010121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 34.
The spelling of 99902010121 in words is "ninety-nine billion, nine hundred two million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •