Base | Representation |
---|---|
bin | 1001000110000101010101… |
… | …01010111011110101011111 |
3 | 2121211000002111100012202121 |
4 | 10203002222222323311133 |
5 | 10110140433131041111 |
6 | 110311551311403411 |
7 | 4132653241315612 |
oct | 443025252736537 |
9 | 77730074305677 |
10 | 20000231112031 |
11 | 641106106aa15 |
12 | 22b0218b23567 |
13 | b21024142211 |
14 | 4d2032c1c179 |
15 | 24a3ba2d8871 |
hex | 1230aaabbd5f |
20000231112031 has 6 divisors (see below), whose sum is σ = 20128432545240. Its totient is φ = 19872841080456.
The previous prime is 20000231112013. The next prime is 20000231112053. The reversal of 20000231112031 is 13021113200002.
It is not a de Polignac number, because 20000231112031 - 29 = 20000231111519 is a prime.
It is a super-2 number, since 2×200002311120312 (a number of 27 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 = 20000231111996 and 20000231112014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000231118031) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 405676011 + ... + 405725308.
It is an arithmetic number, because the mean of its divisors is an integer number (3354738757540).
Almost surely, 220000231112031 is an apocalyptic number.
20000231112031 is a deficient number, since it is larger than the sum of its proper divisors (128201433209).
20000231112031 is an frugal number, since it uses more digits than its factorization.
20000231112031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 811401633 (or 811401476 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 20000231112031 its reverse (13021113200002), we get a palindrome (33021344312033).
The spelling of 20000231112031 in words is "twenty trillion, two hundred thirty-one million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •