Base | Representation |
---|---|
bin | 11011101111111… |
… | …001010000100101 |
3 | 1012102222220000011 |
4 | 123233321100211 |
5 | 1423134241013 |
6 | 114110050221 |
7 | 14352011602 |
oct | 3357712045 |
9 | 1172886004 |
10 | 465540133 |
11 | 219870213 |
12 | 10baa9971 |
13 | 755ab146 |
14 | 45b856a9 |
15 | 2ad0cc3d |
hex | 1bbf9425 |
465540133 has 2 divisors, whose sum is σ = 465540134. Its totient is φ = 465540132.
The previous prime is 465540107. The next prime is 465540137. The reversal of 465540133 is 331045564.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 252905409 + 212634724 = 15903^2 + 14582^2 .
It is a cyclic number.
It is not a de Polignac number, because 465540133 - 221 = 463442981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 465540095 and 465540104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (465540137) 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, 232770066 + 232770067.
It is an arithmetic number, because the mean of its divisors is an integer number (232770067).
Almost surely, 2465540133 is an apocalyptic number.
It is an amenable number.
465540133 is a deficient number, since it is larger than the sum of its proper divisors (1).
465540133 is an equidigital number, since it uses as much as digits as its factorization.
465540133 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 31.
The square root of 465540133 is about 21576.3790521023. The cubic root of 465540133 is about 775.0309431974.
Adding to 465540133 its reverse (331045564), we get a palindrome (796585697).
The spelling of 465540133 in words is "four hundred sixty-five million, five hundred forty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •