Base | Representation |
---|---|
bin | 10010101110110001… |
… | …111111110010111011 |
3 | 1220220122200011222120 |
4 | 102232301333302323 |
5 | 312142211224011 |
6 | 13123414252323 |
7 | 1311253655025 |
oct | 225661776273 |
9 | 56818604876 |
10 | 20112211131 |
11 | 85909009a1 |
12 | 3a936570a3 |
13 | 1b86a0555c |
14 | d8b175015 |
15 | 7caa33a06 |
hex | 4aec7fcbb |
20112211131 has 16 divisors (see below), whose sum is σ = 28446232608. Its totient is φ = 12596083200.
The previous prime is 20112211121. The next prime is 20112211159. The reversal of 20112211131 is 13111221102.
It is not a de Polignac number, because 20112211131 - 27 = 20112211003 is a prime.
It is a super-2 number, since 2×201122111312 (a number of 21 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 20112211131.
It is not an unprimeable number, because it can be changed into a prime (20112211121) 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, 336880 + ... + 392061.
It is an arithmetic number, because the mean of its divisors is an integer number (1777889538).
Almost surely, 220112211131 is an apocalyptic number.
20112211131 is a deficient number, since it is larger than the sum of its proper divisors (8334021477).
20112211131 is a wasteful number, since it uses less digits than its factorization.
20112211131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 729502.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 20112211131 its reverse (13111221102), we get a palindrome (33223432233).
The spelling of 20112211131 in words is "twenty billion, one hundred twelve million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •