Base | Representation |
---|---|
bin | 1001000110111110111000… |
… | …11010000110011110001111 |
3 | 2121220221211220200011200211 |
4 | 10203133130122012132033 |
5 | 10111142223331043043 |
6 | 110334101345103251 |
7 | 4135126040331310 |
oct | 443373432063617 |
9 | 77827756604624 |
10 | 20031130331023 |
11 | 6423177952539 |
12 | 22b6201027b27 |
13 | b23c098b9356 |
14 | 4d372485c607 |
15 | 24b0c7d37a9d |
hex | 1237dc68678f |
20031130331023 has 8 divisors (see below), whose sum is σ = 22907751723648. Its totient is φ = 17158266774744.
The previous prime is 20031130331021. The next prime is 20031130331041. The reversal of 20031130331023 is 32013303113002.
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 20031130331023 - 21 = 20031130331021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20031130330985 and 20031130331003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20031130331021) 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, 939447661 + ... + 939468982.
It is an arithmetic number, because the mean of its divisors is an integer number (2863468965456).
Almost surely, 220031130331023 is an apocalyptic number.
20031130331023 is a deficient number, since it is larger than the sum of its proper divisors (2876621392625).
20031130331023 is a wasteful number, since it uses less digits than its factorization.
20031130331023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1878918173.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 20031130331023 its reverse (32013303113002), we get a palindrome (52044433444025).
The spelling of 20031130331023 in words is "twenty trillion, thirty-one billion, one hundred thirty million, three hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •