Base | Representation |
---|---|
bin | 10110101101110000001010… |
… | …110001011000001011011101 |
3 | 111002201110020211012011022011 |
4 | 112231300022301120023131 |
5 | 101043234443211134323 |
6 | 552245535125351221 |
7 | 30020421612164560 |
oct | 2655601261301335 |
9 | 432643224164264 |
10 | 99901120021213 |
11 | 29916910920645 |
12 | b25560ab68511 |
13 | 43988346a7164 |
14 | 1a953508224d7 |
15 | b839cda7320d |
hex | 5adc0ac582dd |
99901120021213 has 16 divisors (see below), whose sum is σ = 120200435280000. Its totient is φ = 81110134190592.
The previous prime is 99901120021181. The next prime is 99901120021217. The reversal of 99901120021213 is 31212002110999.
It is a cyclic number.
It is not a de Polignac number, because 99901120021213 - 25 = 99901120021181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (99901120021217) 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 in 15 ways as a sum of consecutive naturals, for example, 57378928 + ... + 59094361.
It is an arithmetic number, because the mean of its divisors is an integer number (7512527205000).
Almost surely, 299901120021213 is an apocalyptic number.
It is an amenable number.
99901120021213 is a deficient number, since it is larger than the sum of its proper divisors (20299315258787).
99901120021213 is a wasteful number, since it uses less digits than its factorization.
99901120021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116479764.
The product of its (nonzero) digits is 17496, while the sum is 40.
The spelling of 99901120021213 in words is "ninety-nine trillion, nine hundred one billion, one hundred twenty million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •