Base | Representation |
---|---|
bin | 1001000101110000101… |
… | …00110101000000000111 |
3 | 1002212011211012200001010 |
4 | 10202320110311000013 |
5 | 20104123002104111 |
6 | 355252114133303 |
7 | 31364555104626 |
oct | 4427024650007 |
9 | 1085154180033 |
10 | 312330113031 |
11 | 11050522a762 |
12 | 50646881233 |
13 | 235b64a5791 |
14 | 1118c9316bd |
15 | 81ceddaaa6 |
hex | 48b8535007 |
312330113031 has 4 divisors (see below), whose sum is σ = 416440150712. Its totient is φ = 208220075352.
The previous prime is 312330113023. The next prime is 312330113077. The reversal of 312330113031 is 130311033213.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 312330113031 - 23 = 312330113023 is a prime.
It is a super-2 number, since 2×3123301130312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 312330112989 and 312330113007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312330113021) 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, 52055018836 + ... + 52055018841.
It is an arithmetic number, because the mean of its divisors is an integer number (104110037678).
Almost surely, 2312330113031 is an apocalyptic number.
312330113031 is a deficient number, since it is larger than the sum of its proper divisors (104110037681).
312330113031 is a wasteful number, since it uses less digits than its factorization.
312330113031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104110037680.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 312330113031 its reverse (130311033213), we get a palindrome (442641146244).
The spelling of 312330113031 in words is "three hundred twelve billion, three hundred thirty million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •