Base | Representation |
---|---|
bin | 1110001111000000111001… |
… | …00000110000101000111101 |
3 | 11002211110110010201221122210 |
4 | 13013200130200300220331 |
5 | 13100323401200100013 |
6 | 150324010540331033 |
7 | 6410336460652113 |
oct | 707403440605075 |
9 | 132743403657583 |
10 | 31302200003133 |
11 | 9a79208945154 |
12 | 36166ab543a79 |
13 | 1460a28269597 |
14 | 7a306abb3ab3 |
15 | 394396e1bcc3 |
hex | 1c781c830a3d |
31302200003133 has 8 divisors (see below), whose sum is σ = 41773234139200. Its totient is φ = 20849649601248.
The previous prime is 31302200003117. The next prime is 31302200003143. The reversal of 31302200003133 is 33130000220313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31302200003133 - 24 = 31302200003117 is a prime.
It is a super-2 number, since 2×313022000031332 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31302200003143) 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, 4620929593 + ... + 4620936366.
It is an arithmetic number, because the mean of its divisors is an integer number (5221654267400).
Almost surely, 231302200003133 is an apocalyptic number.
It is an amenable number.
31302200003133 is a deficient number, since it is larger than the sum of its proper divisors (10471034136067).
31302200003133 is a wasteful number, since it uses less digits than its factorization.
31302200003133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9241867091.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 31302200003133 its reverse (33130000220313), we get a palindrome (64432200223446).
The spelling of 31302200003133 in words is "thirty-one trillion, three hundred two billion, two hundred million, three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •