Base | Representation |
---|---|
bin | 1001001001100100110100… |
… | …00010010011110011010010 |
3 | 2122020110210002212200011122 |
4 | 10210302122002103303102 |
5 | 10114122143021023442 |
6 | 110443033011242242 |
7 | 4144431405426413 |
oct | 444623202236322 |
9 | 78213702780148 |
10 | 20120211111122 |
11 | 6457a2a704061 |
12 | 230b521ba9382 |
13 | b2c435145915 |
14 | 4d7b7563980a |
15 | 24d58d63cdd2 |
hex | 124c9a093cd2 |
20120211111122 has 16 divisors (see below), whose sum is σ = 31997621081592. Its totient is φ = 9455892664320.
The previous prime is 20120211111083. The next prime is 20120211111151. The reversal of 20120211111122 is 22111111202102.
It can be written as a sum of positive squares in 4 ways, for example, as 11958739175881 + 8161471935241 = 3458141^2 + 2856829^2 .
It is a super-2 number, since 2×201202111111222 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 20120211111122.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 388785503 + ... + 388837250.
Almost surely, 220120211111122 is an apocalyptic number.
20120211111122 is a deficient number, since it is larger than the sum of its proper divisors (11877409970470).
20120211111122 is a wasteful number, since it uses less digits than its factorization.
20120211111122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777623533.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 20120211111122 its reverse (22111111202102), we get a palindrome (42231322313224).
The spelling of 20120211111122 in words is "twenty trillion, one hundred twenty billion, two hundred eleven million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •