Base | Representation |
---|---|
bin | 1001000111011001110… |
… | …00111110011100100011 |
3 | 1002221110021122101012110 |
4 | 10203230320332130203 |
5 | 20112424233113011 |
6 | 355515420130403 |
7 | 31425454051665 |
oct | 4435470763443 |
9 | 1087407571173 |
10 | 313212004131 |
11 | 110918013584 |
12 | 50852096a03 |
13 | 236c70cb730 |
14 | 11233ad6535 |
15 | 823253bba6 |
hex | 48ece3e723 |
313212004131 has 32 divisors (see below), whose sum is σ = 455560806400. Its totient is φ = 190266620544.
The previous prime is 313212004121. The next prime is 313212004141. The reversal of 313212004131 is 131400212313.
It is an interprime number because it is at equal distance from previous prime (313212004121) and next prime (313212004141).
It is not a de Polignac number, because 313212004131 - 215 = 313211971363 is a prime.
It is a super-2 number, since 2×3132120041312 (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 = 313212004098 and 313212004107.
It is not an unprimeable number, because it can be changed into a prime (313212004121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 826761 + ... + 1144533.
It is an arithmetic number, because the mean of its divisors is an integer number (14236275200).
Almost surely, 2313212004131 is an apocalyptic number.
313212004131 is a deficient number, since it is larger than the sum of its proper divisors (142348802269).
313212004131 is a wasteful number, since it uses less digits than its factorization.
313212004131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318115.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 313212004131 its reverse (131400212313), we get a palindrome (444612216444).
The spelling of 313212004131 in words is "three hundred thirteen billion, two hundred twelve million, four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •