Base | Representation |
---|---|
bin | 101101111110101100000011… |
… | …111111010010110001111011 |
3 | 222112000001012100002200110101 |
4 | 231332230003333102301323 |
5 | 203001133041100334321 |
6 | 1554030331401500231 |
7 | 60410625262066360 |
oct | 5576540377226173 |
9 | 875001170080411 |
10 | 202220012121211 |
11 | 59485030a83187 |
12 | 1a81b714aa1677 |
13 | 88ab35aba2256 |
14 | 37d1702314467 |
15 | 185a317353791 |
hex | b7eb03fd2c7b |
202220012121211 has 4 divisors (see below), whose sum is σ = 231108585281392. Its totient is φ = 173331438961032.
The previous prime is 202220012121191. The next prime is 202220012121227. The reversal of 202220012121211 is 112121210022202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 202220012121211 - 223 = 202220003732603 is a prime.
It is a super-2 number, since 2×2022200121212112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (202220012121251) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14444286580080 + ... + 14444286580093.
It is an arithmetic number, because the mean of its divisors is an integer number (57777146320348).
Almost surely, 2202220012121211 is an apocalyptic number.
202220012121211 is a deficient number, since it is larger than the sum of its proper divisors (28888573160181).
202220012121211 is an equidigital number, since it uses as much as digits as its factorization.
202220012121211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28888573160180.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 202220012121211 its reverse (112121210022202), we get a palindrome (314341222143413).
The spelling of 202220012121211 in words is "two hundred two trillion, two hundred twenty billion, twelve million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •