Base | Representation |
---|---|
bin | 101111110000000100001011… |
… | …100100100010101100111011 |
3 | 1000112120212122022110101010211 |
4 | 233300010023210202230323 |
5 | 210011310424230014321 |
6 | 2022353452403451551 |
7 | 62143544363265313 |
oct | 5760041344425473 |
9 | 1015525568411124 |
10 | 210011210001211 |
11 | 60a09288079183 |
12 | 1b6796b5386bb7 |
13 | 9024c839bb2c8 |
14 | 39c084d88a443 |
15 | 1942d182040e1 |
hex | bf010b922b3b |
210011210001211 has 2 divisors, whose sum is σ = 210011210001212. Its totient is φ = 210011210001210.
The previous prime is 210011210001193. The next prime is 210011210001223. The reversal of 210011210001211 is 112100012110012.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210011210001211 - 213 = 210011209993019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210011210001191 and 210011210001200.
It is not a weakly prime, because it can be changed into another prime (210011210001611) 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, 105005605000605 + 105005605000606.
It is an arithmetic number, because the mean of its divisors is an integer number (105005605000606).
Almost surely, 2210011210001211 is an apocalyptic number.
210011210001211 is a deficient number, since it is larger than the sum of its proper divisors (1).
210011210001211 is an equidigital number, since it uses as much as digits as its factorization.
210011210001211 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 210011210001211 its reverse (112100012110012), we get a palindrome (322111222111223).
The spelling of 210011210001211 in words is "two hundred ten trillion, eleven billion, two hundred ten million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •