Base | Representation |
---|---|
bin | 1001001001100100110101… |
… | …00100100110100111110111 |
3 | 2122020110210201210102010012 |
4 | 10210302122210212213313 |
5 | 10114122202321213421 |
6 | 110443033532050435 |
7 | 4144431545021324 |
oct | 444623244464767 |
9 | 78213721712105 |
10 | 20120220101111 |
11 | 6457a347943a9 |
12 | 230b525003a1b |
13 | b2c436c72840 |
14 | 4d7b768d9b4b |
15 | 24d58e31695b |
hex | 124c9a9269f7 |
20120220101111 has 16 divisors (see below), whose sum is σ = 21932310079680. Its totient is φ = 18346736563200.
The previous prime is 20120220101099. The next prime is 20120220101119. The reversal of 20120220101111 is 11110102202102.
It is a cyclic number.
It is not a de Polignac number, because 20120220101111 - 210 = 20120220100087 is a prime.
It is a super-2 number, since 2×201202201011112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20120220101119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16876730 + ... + 18029543.
It is an arithmetic number, because the mean of its divisors is an integer number (1370769379980).
Almost surely, 220120220101111 is an apocalyptic number.
20120220101111 is a deficient number, since it is larger than the sum of its proper divisors (1812089978569).
20120220101111 is a wasteful number, since it uses less digits than its factorization.
20120220101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34906826.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20120220101111 its reverse (11110102202102), we get a palindrome (31230322303213).
The spelling of 20120220101111 in words is "twenty trillion, one hundred twenty billion, two hundred twenty million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •