Base | Representation |
---|---|
bin | 10010101110110… |
… | …000111111111101 |
3 | 210220022111212202 |
4 | 102232300333331 |
5 | 1120421433323 |
6 | 51103241245 |
7 | 10534034315 |
oct | 2256607775 |
9 | 726274782 |
10 | 314249213 |
11 | 1514270a3 |
12 | 892a9225 |
13 | 501497a5 |
14 | 2da42445 |
15 | 1c8c5d28 |
hex | 12bb0ffd |
314249213 has 2 divisors, whose sum is σ = 314249214. Its totient is φ = 314249212.
The previous prime is 314249209. The next prime is 314249231. The reversal of 314249213 is 312942413.
Together with next prime (314249231) 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., 264940729 + 49308484 = 16277^2 + 7022^2 .
It is a cyclic number.
It is not a de Polignac number, because 314249213 - 22 = 314249209 is a prime.
It is a super-2 number, since 2×3142492132 = 197505135742238738, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (314249413) 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, 157124606 + 157124607.
It is an arithmetic number, because the mean of its divisors is an integer number (157124607).
Almost surely, 2314249213 is an apocalyptic number.
It is an amenable number.
314249213 is a deficient number, since it is larger than the sum of its proper divisors (1).
314249213 is an equidigital number, since it uses as much as digits as its factorization.
314249213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 29.
The square root of 314249213 is about 17727.0757035671. The cubic root of 314249213 is about 679.8682075901.
The spelling of 314249213 in words is "three hundred fourteen million, two hundred forty-nine thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •