Base | Representation |
---|---|
bin | 101101111011101010010110… |
… | …001101111000010111011011 |
3 | 222111021011022110012210212222 |
4 | 231323222112031320113123 |
5 | 202434231100034134321 |
6 | 1553351012005454255 |
7 | 60356612656314560 |
oct | 5573522615702733 |
9 | 874234273183788 |
10 | 202012012021211 |
11 | 594048a4386497 |
12 | 1a7a734611138b |
13 | 88948603065c2 |
14 | 37c560d940867 |
15 | 1854be18b43ab |
hex | b7ba963785db |
202012012021211 has 64 divisors (see below), whose sum is σ = 238345552908288. Its totient is φ = 167653034385408.
The previous prime is 202012012021181. The next prime is 202012012021229. The reversal of 202012012021211 is 112120210210202.
It is a cyclic number.
It is not a de Polignac number, because 202012012021211 - 210 = 202012012020187 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202012012021211.
It is not an unprimeable number, because it can be changed into a prime (202012012021111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13890662606 + ... + 13890677148.
It is an arithmetic number, because the mean of its divisors is an integer number (3724149264192).
Almost surely, 2202012012021211 is an apocalyptic number.
202012012021211 is a deficient number, since it is larger than the sum of its proper divisors (36333540887077).
202012012021211 is a wasteful number, since it uses less digits than its factorization.
202012012021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16060.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 202012012021211 its reverse (112120210210202), we get a palindrome (314132222231413).
The spelling of 202012012021211 in words is "two hundred two trillion, twelve billion, twelve million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •