Base | Representation |
---|---|
bin | 1001000110111110111001… |
… | …00001010110000110000101 |
3 | 2121220221212001020122122002 |
4 | 10203133130201112012011 |
5 | 10111142224322330041 |
6 | 110334101453515045 |
7 | 4135126062430613 |
oct | 443373441260605 |
9 | 77827761218562 |
10 | 20031132230021 |
11 | 6423178a2a260 |
12 | 22b62017a2a85 |
13 | b23c0a102813 |
14 | 4d3724bd46b3 |
15 | 24b0c80b059b |
hex | 1237dc856185 |
20031132230021 has 8 divisors (see below), whose sum is σ = 21865742368704. Its totient is φ = 18198788444320.
The previous prime is 20031132230003. The next prime is 20031132230033. The reversal of 20031132230021 is 12003223113002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-20031132230021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20031132229975 and 20031132230002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20031132230051) 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, 566569760 + ... + 566605113.
It is an arithmetic number, because the mean of its divisors is an integer number (2733217796088).
Almost surely, 220031132230021 is an apocalyptic number.
It is an amenable number.
20031132230021 is a deficient number, since it is larger than the sum of its proper divisors (1834610138683).
20031132230021 is a wasteful number, since it uses less digits than its factorization.
20031132230021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1133176491.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20031132230021 its reverse (12003223113002), we get a palindrome (32034355343023).
The spelling of 20031132230021 in words is "twenty trillion, thirty-one billion, one hundred thirty-two million, two hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •