Base | Representation |
---|---|
bin | 1001000111010000001… |
… | …00110100011111110111 |
3 | 1002221020122122021100212 |
4 | 10203220010310133313 |
5 | 20112243043114111 |
6 | 355503412500035 |
7 | 31423453323404 |
oct | 4435004643767 |
9 | 1087218567325 |
10 | 313131223031 |
11 | 110886459540 |
12 | 5082b01a61b |
13 | 236b3456973 |
14 | 112270a92ab |
15 | 822a3d198b |
hex | 48e81347f7 |
313131223031 has 8 divisors (see below), whose sum is σ = 342335495424. Its totient is φ = 284049916920.
The previous prime is 313131222997. The next prime is 313131223043. The reversal of 313131223031 is 130322131313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 313131223031 - 210 = 313131222007 is a prime.
It is a super-2 number, since 2×3131312230312 (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 = 313131222988 and 313131223006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313131223331) 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, 30736241 + ... + 30746426.
It is an arithmetic number, because the mean of its divisors is an integer number (42791936928).
Almost surely, 2313131223031 is an apocalyptic number.
313131223031 is a deficient number, since it is larger than the sum of its proper divisors (29204272393).
313131223031 is a wasteful number, since it uses less digits than its factorization.
313131223031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61483141.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 313131223031 its reverse (130322131313), we get a palindrome (443453354344).
The spelling of 313131223031 in words is "three hundred thirteen billion, one hundred thirty-one million, two hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •