Base | Representation |
---|---|
bin | 11011101110110… |
… | …100111111100001 |
3 | 1012102110200102212 |
4 | 123232310333201 |
5 | 1423101314023 |
6 | 114100051505 |
7 | 14346435434 |
oct | 3356647741 |
9 | 1172420385 |
10 | 465260513 |
11 | 21969a123 |
12 | 10b993b95 |
13 | 75510aa3 |
14 | 45b1181b |
15 | 2aca4e78 |
hex | 1bbb4fe1 |
465260513 has 2 divisors, whose sum is σ = 465260514. Its totient is φ = 465260512.
The previous prime is 465260501. The next prime is 465260531. The reversal of 465260513 is 315062564.
Together with next prime (465260531) 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., 449948944 + 15311569 = 21212^2 + 3913^2 .
It is a cyclic number.
It is not a de Polignac number, because 465260513 - 26 = 465260449 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 465260513.
It is not a weakly prime, because it can be changed into another prime (465260113) 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, 232630256 + 232630257.
It is an arithmetic number, because the mean of its divisors is an integer number (232630257).
Almost surely, 2465260513 is an apocalyptic number.
It is an amenable number.
465260513 is a deficient number, since it is larger than the sum of its proper divisors (1).
465260513 is an equidigital number, since it uses as much as digits as its factorization.
465260513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 32.
The square root of 465260513 is about 21569.8983075952. The cubic root of 465260513 is about 774.8757417155.
The spelling of 465260513 in words is "four hundred sixty-five million, two hundred sixty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •