Base | Representation |
---|---|
bin | 1001000111100101101… |
… | …10011110000100001011 |
3 | 1002221201020211020011022 |
4 | 10203302312132010023 |
5 | 20113130333314012 |
6 | 355533351423055 |
7 | 31431110101526 |
oct | 4436266360413 |
9 | 1087636736138 |
10 | 313312010507 |
11 | 110969509881 |
12 | 5087b684a8b |
13 | 23711a450c2 |
14 | 112430c9bbd |
15 | 823b1e3472 |
hex | 48f2d9e10b |
313312010507 has 2 divisors, whose sum is σ = 313312010508. Its totient is φ = 313312010506.
The previous prime is 313312010503. The next prime is 313312010533. The reversal of 313312010507 is 705010213313.
It is an a-pointer prime, because the next prime (313312010533) can be obtained adding 313312010507 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 313312010507 - 22 = 313312010503 is a prime.
It is a super-3 number, since 3×3133120105073 (a number of 35 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (313312010503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156656005253 + 156656005254.
It is an arithmetic number, because the mean of its divisors is an integer number (156656005254).
Almost surely, 2313312010507 is an apocalyptic number.
313312010507 is a deficient number, since it is larger than the sum of its proper divisors (1).
313312010507 is an equidigital number, since it uses as much as digits as its factorization.
313312010507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1890, while the sum is 26.
The spelling of 313312010507 in words is "three hundred thirteen billion, three hundred twelve million, ten thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •