Base | Representation |
---|---|
bin | 11011101100010… |
… | …111001110101001 |
3 | 1012101020212000112 |
4 | 123230113032221 |
5 | 1422420124223 |
6 | 114034144105 |
7 | 14341104452 |
oct | 3354271651 |
9 | 1171225015 |
10 | 464614313 |
11 | 219298679 |
12 | 10b722035 |
13 | 75345917 |
14 | 459c4129 |
15 | 2abc8778 |
hex | 1bb173a9 |
464614313 has 2 divisors, whose sum is σ = 464614314. Its totient is φ = 464614312.
The previous prime is 464614289. The next prime is 464614331. The reversal of 464614313 is 313416464.
Together with next prime (464614331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 402724624 + 61889689 = 20068^2 + 7867^2 .
It is a cyclic number.
It is not a de Polignac number, because 464614313 - 28 = 464614057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 464614313.
It is not a weakly prime, because it can be changed into another prime (464614343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 232307156 + 232307157.
It is an arithmetic number, because the mean of its divisors is an integer number (232307157).
Almost surely, 2464614313 is an apocalyptic number.
It is an amenable number.
464614313 is a deficient number, since it is larger than the sum of its proper divisors (1).
464614313 is an equidigital number, since it uses as much as digits as its factorization.
464614313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20736, while the sum is 32.
The square root of 464614313 is about 21554.9138945160. The cubic root of 464614313 is about 774.5168340440.
The spelling of 464614313 in words is "four hundred sixty-four million, six hundred fourteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •