Base | Representation |
---|---|
bin | 101101111110101101000101… |
… | …100010111111111011010011 |
3 | 222112000011000222201022210122 |
4 | 231332231011202333323103 |
5 | 203001142314133001321 |
6 | 1554031032452020455 |
7 | 60410664445646603 |
oct | 5576550542777323 |
9 | 875004028638718 |
10 | 202221112000211 |
11 | 59485545915597 |
12 | 1a81b98130172b |
13 | 88ab4a4a0cb25 |
14 | 37d17a8420c03 |
15 | 185a37dbb38ab |
hex | b7eb458bfed3 |
202221112000211 has 2 divisors, whose sum is σ = 202221112000212. Its totient is φ = 202221112000210.
The previous prime is 202221112000181. The next prime is 202221112000231. The reversal of 202221112000211 is 112000211122202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202221112000211 - 214 = 202221111983827 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202221112000211.
It is not a weakly prime, because it can be changed into another prime (202221112000231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101110556000105 + 101110556000106.
It is an arithmetic number, because the mean of its divisors is an integer number (101110556000106).
Almost surely, 2202221112000211 is an apocalyptic number.
202221112000211 is a deficient number, since it is larger than the sum of its proper divisors (1).
202221112000211 is an equidigital number, since it uses as much as digits as its factorization.
202221112000211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 202221112000211 its reverse (112000211122202), we get a palindrome (314221323122413).
The spelling of 202221112000211 in words is "two hundred two trillion, two hundred twenty-one billion, one hundred twelve million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •