Base | Representation |
---|---|
bin | 1110001001011011010100… |
… | …10100111111010111000110 |
3 | 11002011002221120002121021210 |
4 | 13010231222110333113012 |
5 | 13034202223343342410 |
6 | 150055502052152250 |
7 | 6360432356652210 |
oct | 704555224772706 |
9 | 132132846077253 |
10 | 31110232012230 |
11 | 9a04858a242a8 |
12 | 35a5455908686 |
13 | 14488b3cb9b17 |
14 | 797a5972d5b0 |
15 | 38e3adbb7220 |
hex | 1c4b6a53f5c6 |
31110232012230 has 64 divisors (see below), whose sum is σ = 86128407406080. Its totient is φ = 7044453064704.
The previous prime is 31110232012217. The next prime is 31110232012309. The reversal of 31110232012230 is 3221023201113.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 31110232012197 and 31110232012206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 692239035 + ... + 692283974.
It is an arithmetic number, because the mean of its divisors is an integer number (1345756365720).
Almost surely, 231110232012230 is an apocalyptic number.
31110232012230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31110232012230 is an abundant number, since it is smaller than the sum of its proper divisors (55018175393850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31110232012230 is a wasteful number, since it uses less digits than its factorization.
31110232012230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1384523133.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 31110232012230 its reverse (3221023201113), we get a palindrome (34331255213343).
The spelling of 31110232012230 in words is "thirty-one trillion, one hundred ten billion, two hundred thirty-two million, twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •