Base | Representation |
---|---|
bin | 1001010001110010100000… |
… | …1101100011110001000011 |
3 | 1100010020010200212111102101 |
4 | 2110130220031203301003 |
5 | 2314114100311033021 |
6 | 33410213210131231 |
7 | 2102004535025101 |
oct | 224345015436103 |
9 | 40106120774371 |
10 | 10201221971011 |
11 | 328334a948115 |
12 | 1189094720b17 |
13 | 58cc81692466 |
14 | 273a5561cc71 |
15 | 12a5557e2a91 |
hex | 94728363c43 |
10201221971011 has 2 divisors, whose sum is σ = 10201221971012. Its totient is φ = 10201221971010.
The previous prime is 10201221971009. The next prime is 10201221971029. The reversal of 10201221971011 is 11017912210201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10201221971011 - 21 = 10201221971009 is a prime.
Together with 10201221971009, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10201221971111) 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, 5100610985505 + 5100610985506.
It is an arithmetic number, because the mean of its divisors is an integer number (5100610985506).
Almost surely, 210201221971011 is an apocalyptic number.
10201221971011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201221971011 is an equidigital number, since it uses as much as digits as its factorization.
10201221971011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 28.
The spelling of 10201221971011 in words is "ten trillion, two hundred one billion, two hundred twenty-one million, nine hundred seventy-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •