Base | Representation |
---|---|
bin | 10001011111011101111… |
… | …110110111101001111011 |
3 | 11020220121211220220022120 |
4 | 101133131332313221323 |
5 | 124143214122334321 |
6 | 2320111142452323 |
7 | 152562115310160 |
oct | 21373576675173 |
9 | 4226554826276 |
10 | 1202020121211 |
11 | 423857027058 |
12 | 174b621340a3 |
13 | 89471c886c0 |
14 | 4226c940067 |
15 | 21402224ec6 |
hex | 117ddfb7a7b |
1202020121211 has 64 divisors (see below), whose sum is σ = 2026322866176. Its totient is φ = 616754995200.
The previous prime is 1202020121179. The next prime is 1202020121227. The reversal of 1202020121211 is 1121210202021.
It is not a de Polignac number, because 1202020121211 - 25 = 1202020121179 is a prime.
It is a super-2 number, since 2×12020201212112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1202020121011) 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, 54948606 + ... + 54970476.
It is an arithmetic number, because the mean of its divisors is an integer number (31661294784).
Almost surely, 21202020121211 is an apocalyptic number.
1202020121211 is a deficient number, since it is larger than the sum of its proper divisors (824302744965).
1202020121211 is a wasteful number, since it uses less digits than its factorization.
1202020121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27372.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1202020121211 its reverse (1121210202021), we get a palindrome (2323230323232).
It can be divided in two parts, 1202020 and 121211, that added together give a palindrome (1323231).
The spelling of 1202020121211 in words is "one trillion, two hundred two billion, twenty million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •