Base | Representation |
---|---|
bin | 1110001010000100011111… |
… | …00110101000110111000010 |
3 | 11002020012222202120002121202 |
4 | 13011002033212220313002 |
5 | 13040033004022412010 |
6 | 150113555044421202 |
7 | 6362144133510203 |
oct | 705021746506702 |
9 | 132205882502552 |
10 | 31132332232130 |
11 | 9a13169a21648 |
12 | 35a97a30a7802 |
13 | 144a9c682b70c |
14 | 798b5491b5aa |
15 | 38ec53ee06a5 |
hex | 1c508f9a8dc2 |
31132332232130 has 8 divisors (see below), whose sum is σ = 56038198017852. Its totient is φ = 12452932892848.
The previous prime is 31132332232081. The next prime is 31132332232139. The reversal of 31132332232130 is 3123223323113.
It can be written as a sum of positive squares in 2 ways, for example, as 26340493025401 + 4791839206729 = 5132299^2 + 2189027^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×311323322321302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31132332232093 and 31132332232102.
It is not an unprimeable number, because it can be changed into a prime (31132332232139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1556616611597 + ... + 1556616611616.
Almost surely, 231132332232130 is an apocalyptic number.
31132332232130 is a deficient number, since it is larger than the sum of its proper divisors (24905865785722).
31132332232130 is a wasteful number, since it uses less digits than its factorization.
31132332232130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3113233223220.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 31132332232130 its reverse (3123223323113), we get a palindrome (34255555555243).
The spelling of 31132332232130 in words is "thirty-one trillion, one hundred thirty-two billion, three hundred thirty-two million, two hundred thirty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •