Base | Representation |
---|---|
bin | 11011101110011… |
… | …011110000100101 |
3 | 1012102021102122212 |
4 | 123232123300211 |
5 | 1423040012112 |
6 | 114053533205 |
7 | 14345525213 |
oct | 3356336045 |
9 | 1172242585 |
10 | 465157157 |
11 | 219629503 |
12 | 10b944205 |
13 | 754a5a2a |
14 | 45ac5cb3 |
15 | 2ac84522 |
hex | 1bb9bc25 |
465157157 has 2 divisors, whose sum is σ = 465157158. Its totient is φ = 465157156.
The previous prime is 465157153. The next prime is 465157159. The reversal of 465157157 is 751751564.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 305235841 + 159921316 = 17471^2 + 12646^2 .
It is a cyclic number.
It is not a de Polignac number, because 465157157 - 22 = 465157153 is a prime.
Together with 465157159, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (465157153) 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, 232578578 + 232578579.
It is an arithmetic number, because the mean of its divisors is an integer number (232578579).
Almost surely, 2465157157 is an apocalyptic number.
It is an amenable number.
465157157 is a deficient number, since it is larger than the sum of its proper divisors (1).
465157157 is an equidigital number, since it uses as much as digits as its factorization.
465157157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 147000, while the sum is 41.
The square root of 465157157 is about 21567.5023356901. The cubic root of 465157157 is about 774.8183588185.
It can be divided in two parts, 465 and 157157, that multiplied together give a triangular number (73078005 = T12089).
The spelling of 465157157 in words is "four hundred sixty-five million, one hundred fifty-seven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •