Base | Representation |
---|---|
bin | 101111111111111010010011… |
… | …101111000111111000100011 |
3 | 1000200102222022101222210022022 |
4 | 233333322103233013320203 |
5 | 210132131022011432321 |
6 | 2024550020141532055 |
7 | 62315323536625643 |
oct | 5777722357077043 |
9 | 1020388271883268 |
10 | 211100121202211 |
11 | 6129907106037a |
12 | 1b81474b57402b |
13 | 90a386b34a847 |
14 | 3a1b42c36a523 |
15 | 19612ea424dab |
hex | bffe93bc7e23 |
211100121202211 has 2 divisors, whose sum is σ = 211100121202212. Its totient is φ = 211100121202210.
The previous prime is 211100121202163. The next prime is 211100121202219. The reversal of 211100121202211 is 112202121001112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211100121202211 - 226 = 211100054093347 is a prime.
It is a super-2 number, since 2×2111001212022112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 211100121202211.
It is not a weakly prime, because it can be changed into another prime (211100121202219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105550060601105 + 105550060601106.
It is an arithmetic number, because the mean of its divisors is an integer number (105550060601106).
Almost surely, 2211100121202211 is an apocalyptic number.
211100121202211 is a deficient number, since it is larger than the sum of its proper divisors (1).
211100121202211 is an equidigital number, since it uses as much as digits as its factorization.
211100121202211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 211100121202211 its reverse (112202121001112), we get a palindrome (323302242203323).
The spelling of 211100121202211 in words is "two hundred eleven trillion, one hundred billion, one hundred twenty-one million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •