Base | Representation |
---|---|
bin | 101111111110011110000000… |
… | …111010101001110110011011 |
3 | 1000200002111111221212120122211 |
4 | 233332132000322221312123 |
5 | 210124020042412210021 |
6 | 2024432310405055551 |
7 | 62305215001610614 |
oct | 5776360072516633 |
9 | 1020074457776584 |
10 | 211001021210011 |
11 | 6126003776247a |
12 | 1b7b94b30b75b7 |
13 | 90974071381c6 |
14 | 3a1670aa68c0b |
15 | 195d94a2193e1 |
hex | bfe780ea9d9b |
211001021210011 has 2 divisors, whose sum is σ = 211001021210012. Its totient is φ = 211001021210010.
The previous prime is 211001021209973. The next prime is 211001021210027. The reversal of 211001021210011 is 110012120100112.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211001021210011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211001021209973 and 211001021210000.
It is not a weakly prime, because it can be changed into another prime (211001021210711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105500510605005 + 105500510605006.
It is an arithmetic number, because the mean of its divisors is an integer number (105500510605006).
Almost surely, 2211001021210011 is an apocalyptic number.
211001021210011 is a deficient number, since it is larger than the sum of its proper divisors (1).
211001021210011 is an equidigital number, since it uses as much as digits as its factorization.
211001021210011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 211001021210011 its reverse (110012120100112), we get a palindrome (321013141310123).
The spelling of 211001021210011 in words is "two hundred eleven trillion, one billion, twenty-one million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •