Base | Representation |
---|---|
bin | 1110001111000001000110… |
… | …00101100011000011110011 |
3 | 11002211110201211022010102011 |
4 | 13013200203011203003303 |
5 | 13100324112414411011 |
6 | 150324025520503351 |
7 | 6410342300362630 |
oct | 707404305430363 |
9 | 132743654263364 |
10 | 31302310310131 |
11 | 9a79265136463 |
12 | 361672047ab57 |
13 | 1460a4507b5b3 |
14 | 7a307b6c9187 |
15 | 3943a195a621 |
hex | 1c78231630f3 |
31302310310131 has 16 divisors (see below), whose sum is σ = 36023603535360. Its totient is φ = 26643716084160.
The previous prime is 31302310310113. The next prime is 31302310310189. The reversal of 31302310310131 is 13101301320313.
It is not a de Polignac number, because 31302310310131 - 27 = 31302310310003 is a prime.
It is a super-2 number, since 2×313023103101312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (31302310310731) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11947650 + ... + 14330071.
It is an arithmetic number, because the mean of its divisors is an integer number (2251475220960).
Almost surely, 231302310310131 is an apocalyptic number.
31302310310131 is a deficient number, since it is larger than the sum of its proper divisors (4721293225229).
31302310310131 is a wasteful number, since it uses less digits than its factorization.
31302310310131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26278914.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 31302310310131 its reverse (13101301320313), we get a palindrome (44403611630444).
The spelling of 31302310310131 in words is "thirty-one trillion, three hundred two billion, three hundred ten million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •