Base | Representation |
---|---|
bin | 1001000111000000101… |
… | …00000110101110100011 |
3 | 1002220220120121212120221 |
4 | 10203200110012232203 |
5 | 20112011224342011 |
6 | 355442441543511 |
7 | 31420312463653 |
oct | 4434024065643 |
9 | 1086816555527 |
10 | 313001012131 |
11 | 110819a03125 |
12 | 507b34a4b97 |
13 | 236924961b2 |
14 | 11213a92363 |
15 | 821dc60971 |
hex | 48e0506ba3 |
313001012131 has 4 divisors (see below), whose sum is σ = 331412836392. Its totient is φ = 294589187872.
The previous prime is 313001012119. The next prime is 313001012143. The reversal of 313001012131 is 131210100313.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (313001012119) and next prime (313001012143).
It is a cyclic number.
It is not a de Polignac number, because 313001012131 - 27 = 313001012003 is a prime.
It is a super-2 number, since 2×3130010121312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313001012161) 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, 9205912105 + ... + 9205912138.
It is an arithmetic number, because the mean of its divisors is an integer number (82853209098).
Almost surely, 2313001012131 is an apocalyptic number.
313001012131 is a deficient number, since it is larger than the sum of its proper divisors (18411824261).
313001012131 is a wasteful number, since it uses less digits than its factorization.
313001012131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18411824260.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 313001012131 its reverse (131210100313), we get a palindrome (444211112444).
The spelling of 313001012131 in words is "three hundred thirteen billion, one million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •