Base | Representation |
---|---|
bin | 1001010001110010000011… |
… | …1101000111111000101111 |
3 | 1100010012211012210000011201 |
4 | 2110130200331013320233 |
5 | 2314113323124100444 |
6 | 33410153140430331 |
7 | 2102001526130521 |
oct | 224344075077057 |
9 | 40105735700151 |
10 | 10201100221999 |
11 | 32832981512a5 |
12 | 118905b9a83a7 |
13 | 58cc623a541b |
14 | 273a433a9a11 |
15 | 12a549c93dd4 |
hex | 94720f47e2f |
10201100221999 has 2 divisors, whose sum is σ = 10201100222000. Its totient is φ = 10201100221998.
The previous prime is 10201100221987. The next prime is 10201100222021. The reversal of 10201100221999 is 99912200110201.
It is a weak prime.
It is an emirp because it is prime and its reverse (99912200110201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10201100221999 - 229 = 10200563351087 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10201100221799) 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, 5100550110999 + 5100550111000.
It is an arithmetic number, because the mean of its divisors is an integer number (5100550111000).
Almost surely, 210201100221999 is an apocalyptic number.
10201100221999 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201100221999 is an equidigital number, since it uses as much as digits as its factorization.
10201100221999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 37.
The spelling of 10201100221999 in words is "ten trillion, two hundred one billion, one hundred million, two hundred twenty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •