Base | Representation |
---|---|
bin | 1110001111100010000011… |
… | …00011000001011001010110 |
3 | 11002220011101201212120112210 |
4 | 13013301001203001121112 |
5 | 13101121330303102410 |
6 | 150340113202254250 |
7 | 6411536553555060 |
oct | 707610143013126 |
9 | 132804351776483 |
10 | 31320001222230 |
11 | 9a858131a7576 |
12 | 361a039057386 |
13 | 146260424b716 |
14 | 7a3c79058730 |
15 | 394a89b0c220 |
hex | 1c7c418c1656 |
31320001222230 has 64 divisors (see below), whose sum is σ = 85913586551808. Its totient is φ = 7158249298560.
The previous prime is 31320001222171. The next prime is 31320001222291. The reversal of 31320001222230 is 3222210002313.
It is a happy number.
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 = 31320001222197 and 31320001222206.
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, 3854301 + ... + 8803160.
It is an arithmetic number, because the mean of its divisors is an integer number (1342399789872).
Almost surely, 231320001222230 is an apocalyptic number.
31320001222230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31320001222230 is an abundant number, since it is smaller than the sum of its proper divisors (54593585329578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31320001222230 is a wasteful number, since it uses less digits than its factorization.
31320001222230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12669261.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 31320001222230 its reverse (3222210002313), we get a palindrome (34542211224543).
The spelling of 31320001222230 in words is "thirty-one trillion, three hundred twenty billion, one million, two hundred twenty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •