Base | Representation |
---|---|
bin | 1001001001010011111000… |
… | …10010110111011000111010 |
3 | 2122012121022200111011012022 |
4 | 10210221330102313120322 |
5 | 10114000034240400442 |
6 | 110434531052314442 |
7 | 4143660233106542 |
oct | 444517422673072 |
9 | 78177280434168 |
10 | 20111122200122 |
11 | 6454096205768 |
12 | 2309806172a22 |
13 | b2b617135285 |
14 | 4d75524bc322 |
15 | 24d20a74c3d2 |
hex | 124a7c4b763a |
20111122200122 has 32 divisors (see below), whose sum is σ = 31693811014800. Its totient is φ = 9558473154048.
The previous prime is 20111122200121. The next prime is 20111122200167. The reversal of 20111122200122 is 22100222111102.
It can be written as a sum of positive squares in 8 ways, for example, as 14406662863321 + 5704459336801 = 3795611^2 + 2388401^2 .
It is a super-2 number, since 2×201111222001222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20111122200122.
It is not an unprimeable number, because it can be changed into a prime (20111122200121) 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, 9138443 + ... + 11123550.
Almost surely, 220111122200122 is an apocalyptic number.
20111122200122 is a deficient number, since it is larger than the sum of its proper divisors (11582688814678).
20111122200122 is a wasteful number, since it uses less digits than its factorization.
20111122200122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20262290.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20111122200122 its reverse (22100222111102), we get a palindrome (42211344311224).
The spelling of 20111122200122 in words is "twenty trillion, one hundred eleven billion, one hundred twenty-two million, two hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •