Base | Representation |
---|---|
bin | 101111111111111010010010… |
… | …011111000011001000000001 |
3 | 1000200102222020221111100001111 |
4 | 233333322102133003020001 |
5 | 210132131001123224301 |
6 | 2024550014112003321 |
7 | 62315323163331445 |
oct | 5777722237031001 |
9 | 1020388227440044 |
10 | 211100100211201 |
11 | 61299060223533 |
12 | 1b814744530541 |
13 | 90a3866bab326 |
14 | 3a1b429664825 |
15 | 19612e867a551 |
hex | bffe927c3201 |
211100100211201 has 2 divisors, whose sum is σ = 211100100211202. Its totient is φ = 211100100211200.
The previous prime is 211100100211199. The next prime is 211100100211219. The reversal of 211100100211201 is 102112001001112.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 181975351550976 + 29124748660225 = 13489824^2 + 5396735^2 .
It is a cyclic number.
It is not a de Polignac number, because 211100100211201 - 21 = 211100100211199 is a prime.
Together with 211100100211199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (211100100211241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105550050105600 + 105550050105601.
It is an arithmetic number, because the mean of its divisors is an integer number (105550050105601).
Almost surely, 2211100100211201 is an apocalyptic number.
It is an amenable number.
211100100211201 is a deficient number, since it is larger than the sum of its proper divisors (1).
211100100211201 is an equidigital number, since it uses as much as digits as its factorization.
211100100211201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 211100100211201 its reverse (102112001001112), we get a palindrome (313212101212313).
The spelling of 211100100211201 in words is "two hundred eleven trillion, one hundred billion, one hundred million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •