Base | Representation |
---|---|
bin | 101101111011101010100010… |
… | …001001001100111001111011 |
3 | 222111021011211101201221111002 |
4 | 231323222202021030321323 |
5 | 202434232002300334321 |
6 | 1553351043514355215 |
7 | 60356620636166522 |
oct | 5573524211147173 |
9 | 874234741657432 |
10 | 202012212121211 |
11 | 59404997327598 |
12 | 1a7a73a112bb0b |
13 | 88948928c727b |
14 | 37c562c34b4b9 |
15 | 1854c0423d20b |
hex | b7baa224ce7b |
202012212121211 has 4 divisors (see below), whose sum is σ = 202168932225000. Its totient is φ = 201855492017424.
The previous prime is 202012212121207. The next prime is 202012212121337. The reversal of 202012212121211 is 112121212210202.
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 202012212121211 - 22 = 202012212121207 is a prime.
It is a super-2 number, since 2×2020122121212112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202012212126211) 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, 78360049961 + ... + 78360052538.
It is an arithmetic number, because the mean of its divisors is an integer number (50542233056250).
Almost surely, 2202012212121211 is an apocalyptic number.
202012212121211 is a deficient number, since it is larger than the sum of its proper divisors (156720103789).
202012212121211 is a wasteful number, since it uses less digits than its factorization.
202012212121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156720103788.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 202012212121211 its reverse (112121212210202), we get a palindrome (314133424331413).
The spelling of 202012212121211 in words is "two hundred two trillion, twelve billion, two hundred twelve million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •