Base | Representation |
---|---|
bin | 11110101010010… |
… | …001000010011001 |
3 | 1022211221001002022 |
4 | 132222101002121 |
5 | 2023141140223 |
6 | 123013144225 |
7 | 15514203464 |
oct | 3652210231 |
9 | 1284831068 |
10 | 514396313 |
11 | 2443aa622 |
12 | 12432b075 |
13 | 82755a22 |
14 | 4c4622db |
15 | 3025dac8 |
hex | 1ea91099 |
514396313 has 2 divisors, whose sum is σ = 514396314. Its totient is φ = 514396312.
The previous prime is 514396307. The next prime is 514396331. The reversal of 514396313 is 313693415.
Together with next prime (514396331) 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., 356341129 + 158055184 = 18877^2 + 12572^2 .
It is a cyclic number.
It is not a de Polignac number, because 514396313 - 26 = 514396249 is a prime.
It is a super-3 number, since 3×5143963133 (a number of 27 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (514396343) 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, 257198156 + 257198157.
It is an arithmetic number, because the mean of its divisors is an integer number (257198157).
Almost surely, 2514396313 is an apocalyptic number.
It is an amenable number.
514396313 is a deficient number, since it is larger than the sum of its proper divisors (1).
514396313 is an equidigital number, since it uses as much as digits as its factorization.
514396313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 29160, while the sum is 35.
The square root of 514396313 is about 22680.3067219119. The cubic root of 514396313 is about 801.2461376060.
The spelling of 514396313 in words is "five hundred fourteen million, three hundred ninety-six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •