Base | Representation |
---|---|
bin | 1001001001010011111000… |
… | …10010100011110110101111 |
3 | 2122012121022200100002102221 |
4 | 10210221330102203312233 |
5 | 10114000034230320421 |
6 | 110434531050500211 |
7 | 4143660232324351 |
oct | 444517422436657 |
9 | 78177280302387 |
10 | 20111122120111 |
11 | 6454096160640 |
12 | 2309806134667 |
13 | b2b617107a29 |
14 | 4d755249b0d1 |
15 | 24d20a733841 |
hex | 124a7c4a3daf |
20111122120111 has 8 divisors (see below), whose sum is σ = 22695937189200. Its totient is φ = 17652395591040.
The previous prime is 20111122120097. The next prime is 20111122120123. The reversal of 20111122120111 is 11102122111102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20111122120111 - 27 = 20111122119983 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111122127111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31522134666 + ... + 31522135303.
It is an arithmetic number, because the mean of its divisors is an integer number (2836992148650).
Almost surely, 220111122120111 is an apocalyptic number.
20111122120111 is a deficient number, since it is larger than the sum of its proper divisors (2584815069089).
20111122120111 is a wasteful number, since it uses less digits than its factorization.
20111122120111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63044270009.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 20111122120111 its reverse (11102122111102), we get a palindrome (31213244231213).
Subtracting from 20111122120111 its reverse (11102122111102), we obtain a palindrome (9009000009009).
The spelling of 20111122120111 in words is "twenty trillion, one hundred eleven billion, one hundred twenty-two million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •