Base | Representation |
---|---|
bin | 1001001001010101101101… |
… | …01101010001001110011110 |
3 | 2122012200211222112022121022 |
4 | 10210222312231101032132 |
5 | 10114004041130401342 |
6 | 110435212221204142 |
7 | 4144023433011644 |
oct | 444526655211636 |
9 | 78180758468538 |
10 | 20112102200222 |
11 | 64545494092aa |
12 | 2309a3a400652 |
13 | b2b74218c0a6 |
14 | 4d7606701194 |
15 | 24d2667cc9d2 |
hex | 124ab6b5139e |
20112102200222 has 4 divisors (see below), whose sum is σ = 30168153300336. Its totient is φ = 10056051100110.
The previous prime is 20112102200153. The next prime is 20112102200237. The reversal of 20112102200222 is 22200220121102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×201121022002222 (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 20112102200222.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 5028025550054 + ... + 5028025550057.
It is an arithmetic number, because the mean of its divisors is an integer number (7542038325084).
Almost surely, 220112102200222 is an apocalyptic number.
20112102200222 is a deficient number, since it is larger than the sum of its proper divisors (10056051100114).
20112102200222 is a wasteful number, since it uses less digits than its factorization.
20112102200222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10056051100113.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 20112102200222 its reverse (22200220121102), we get a palindrome (42312322321324).
The spelling of 20112102200222 in words is "twenty trillion, one hundred twelve billion, one hundred two million, two hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •