Base | Representation |
---|---|
bin | 10010110000101… |
… | …111001100100001 |
3 | 210221021202221012 |
4 | 102300233030201 |
5 | 1121040003423 |
6 | 51122310305 |
7 | 10541316314 |
oct | 2260571441 |
9 | 727252835 |
10 | 314766113 |
11 | 15174a492 |
12 | 894b8395 |
13 | 5029ab4c |
14 | 2db3897b |
15 | 1c979078 |
hex | 12c2f321 |
314766113 has 2 divisors, whose sum is σ = 314766114. Its totient is φ = 314766112.
The previous prime is 314766083. The next prime is 314766139. The reversal of 314766113 is 311667413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 220908769 + 93857344 = 14863^2 + 9688^2 .
It is an emirp because it is prime and its reverse (311667413) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 314766113 - 210 = 314765089 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 314766113.
It is not a weakly prime, because it can be changed into another prime (314766163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 157383056 + 157383057.
It is an arithmetic number, because the mean of its divisors is an integer number (157383057).
Almost surely, 2314766113 is an apocalyptic number.
It is an amenable number.
314766113 is a deficient number, since it is larger than the sum of its proper divisors (1).
314766113 is an equidigital number, since it uses as much as digits as its factorization.
314766113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9072, while the sum is 32.
The square root of 314766113 is about 17741.6491059879. The cubic root of 314766113 is about 680.2407689791.
The spelling of 314766113 in words is "three hundred fourteen million, seven hundred sixty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •