Base | Representation |
---|---|
bin | 10010101110110001… |
… | …010001001000111111 |
3 | 1220220122022110211210 |
4 | 102232301101020333 |
5 | 312142134120111 |
6 | 13123410215503 |
7 | 1311252230625 |
oct | 225661211077 |
9 | 56818273753 |
10 | 20112020031 |
11 | 8590790364 |
12 | 3a93584593 |
13 | 1b8696958c |
14 | d8b125515 |
15 | 7ca9e70a6 |
hex | 4aec5123f |
20112020031 has 8 divisors (see below), whose sum is σ = 26816935600. Its totient is φ = 13407558912.
The previous prime is 20112020021. The next prime is 20112020041. The reversal of 20112020031 is 13002021102.
It is an interprime number because it is at equal distance from previous prime (20112020021) and next prime (20112020041).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20112020031 - 29 = 20112019519 is a prime.
It is a super-2 number, since 2×201120200312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20112019989 and 20112020016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112020021) 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, 8361 + ... + 200733.
It is an arithmetic number, because the mean of its divisors is an integer number (3352116950).
Almost surely, 220112020031 is an apocalyptic number.
20112020031 is a deficient number, since it is larger than the sum of its proper divisors (6704915569).
20112020031 is a wasteful number, since it uses less digits than its factorization.
20112020031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227225.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 20112020031 its reverse (13002021102), we get a palindrome (33114041133).
The spelling of 20112020031 in words is "twenty billion, one hundred twelve million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •