Base | Representation |
---|---|
bin | 1001000110111101000000… |
… | …01100110110000100110111 |
3 | 2121220212020111222101000201 |
4 | 10203132200030312010313 |
5 | 10111133141234114111 |
6 | 110333413223021331 |
7 | 4135062023501122 |
oct | 443364014660467 |
9 | 77825214871021 |
10 | 20030120223031 |
11 | 64227a9755446 |
12 | 22b5b7a89a847 |
13 | b23aa8550409 |
14 | 4d366a63d3b9 |
15 | 24b06930b6c1 |
hex | 1237a0336137 |
20030120223031 has 8 divisors (see below), whose sum is σ = 20046474000000. Its totient is φ = 20013766955520.
The previous prime is 20030120223023. The next prime is 20030120223079. The reversal of 20030120223031 is 13032202103002.
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 20030120223031 - 23 = 20030120223023 is a prime.
It is a super-2 number, since 2×200301202230312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20030120224031) 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, 151851195 + ... + 151983043.
It is an arithmetic number, because the mean of its divisors is an integer number (2505809250000).
Almost surely, 220030120223031 is an apocalyptic number.
20030120223031 is a deficient number, since it is larger than the sum of its proper divisors (16353776969).
20030120223031 is a wasteful number, since it uses less digits than its factorization.
20030120223031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254729.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 20030120223031 its reverse (13032202103002), we get a palindrome (33062322326033).
The spelling of 20030120223031 in words is "twenty trillion, thirty billion, one hundred twenty million, two hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •