Base | Representation |
---|---|
bin | 10010100111110… |
… | …011101011111101 |
3 | 210202212211211012 |
4 | 102213303223331 |
5 | 1114440101323 |
6 | 51000205005 |
7 | 10512366452 |
oct | 2247635375 |
9 | 722784735 |
10 | 312425213 |
11 | 1503a0761 |
12 | 88769765 |
13 | 4c95b4b9 |
14 | 2d6c9829 |
15 | 1c665678 |
hex | 129f3afd |
312425213 has 2 divisors, whose sum is σ = 312425214. Its totient is φ = 312425212.
The previous prime is 312425203. The next prime is 312425231. The reversal of 312425213 is 312524213.
Together with next prime (312425231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 222516889 + 89908324 = 14917^2 + 9482^2 .
It is a cyclic number.
It is not a de Polignac number, because 312425213 - 212 = 312421117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312425203) 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, 156212606 + 156212607.
It is an arithmetic number, because the mean of its divisors is an integer number (156212607).
Almost surely, 2312425213 is an apocalyptic number.
It is an amenable number.
312425213 is a deficient number, since it is larger than the sum of its proper divisors (1).
312425213 is an equidigital number, since it uses as much as digits as its factorization.
312425213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1440, while the sum is 23.
The square root of 312425213 is about 17675.5541072975. The cubic root of 312425213 is about 678.5502656563.
Adding to 312425213 its reverse (312524213), we get a palindrome (624949426).
The spelling of 312425213 in words is "three hundred twelve million, four hundred twenty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •