Base | Representation |
---|---|
bin | 1001001001010011111001… |
… | …10001110011110111000011 |
3 | 2122012121100020202021210002 |
4 | 10210221330301303313003 |
5 | 10114000043324442011 |
6 | 110434531542230215 |
7 | 4143660362053655 |
oct | 444517461636703 |
9 | 78177306667702 |
10 | 20111130312131 |
11 | 645409a846401 |
12 | 2309808a2536b |
13 | b2b618a15691 |
14 | 4d75535d06d5 |
15 | 24d20b300c3b |
hex | 124a7cc73dc3 |
20111130312131 has 8 divisors (see below), whose sum is σ = 20761539369984. Its totient is φ = 19460825186760.
The previous prime is 20111130312109. The next prime is 20111130312173. The reversal of 20111130312131 is 13121303111102.
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 20111130312131 - 226 = 20111063203267 is a prime.
It is a super-2 number, since 2×201111303121312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20111130312101) 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, 25589765 + ... + 26363958.
It is an arithmetic number, because the mean of its divisors is an integer number (2595192421248).
Almost surely, 220111130312131 is an apocalyptic number.
20111130312131 is a deficient number, since it is larger than the sum of its proper divisors (650409057853).
20111130312131 is a wasteful number, since it uses less digits than its factorization.
20111130312131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51966241.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 20111130312131 its reverse (13121303111102), we get a palindrome (33232433423233).
The spelling of 20111130312131 in words is "twenty trillion, one hundred eleven billion, one hundred thirty million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •