Base | Representation |
---|---|
bin | 1001000110000111001100… |
… | …01101110100011001001011 |
3 | 2121211002200010010200112201 |
4 | 10203003212031310121023 |
5 | 10110200004402043311 |
6 | 110312234355421031 |
7 | 4133020061554126 |
oct | 443034615643113 |
9 | 77732603120481 |
10 | 20001230112331 |
11 | 6411523a706a6 |
12 | 22b04575b4777 |
13 | b211530bc360 |
14 | 4d20c97893bd |
15 | 24a427d6d9c1 |
hex | 1230e637464b |
20001230112331 has 16 divisors (see below), whose sum is σ = 21905232340320. Its totient is φ = 18149444893440.
The previous prime is 20001230112329. The next prime is 20001230112361. The reversal of 20001230112331 is 13321103210002.
It is a cyclic number.
It is not a de Polignac number, because 20001230112331 - 21 = 20001230112329 is a prime.
It is a super-2 number, since 2×200012301123312 (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 = 20001230112299 and 20001230112308.
It is not an unprimeable number, because it can be changed into a prime (20001230112361) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54991351 + ... + 55353871.
It is an arithmetic number, because the mean of its divisors is an integer number (1369077021270).
Almost surely, 220001230112331 is an apocalyptic number.
20001230112331 is a deficient number, since it is larger than the sum of its proper divisors (1904002227989).
20001230112331 is a wasteful number, since it uses less digits than its factorization.
20001230112331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434526.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 20001230112331 its reverse (13321103210002), we get a palindrome (33322333322333).
The spelling of 20001230112331 in words is "twenty trillion, one billion, two hundred thirty million, one hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •