Base | Representation |
---|---|
bin | 11011110100000… |
… | …010001000011101 |
3 | 1012112001000020101 |
4 | 123310002020131 |
5 | 1423424000203 |
6 | 114145221101 |
7 | 14364150616 |
oct | 3364021035 |
9 | 1175030211 |
10 | 466625053 |
11 | 21a441344 |
12 | 110331791 |
13 | 7589abcb |
14 | 45d88c0d |
15 | 2ae7441d |
hex | 1bd0221d |
466625053 has 2 divisors, whose sum is σ = 466625054. Its totient is φ = 466625052.
The previous prime is 466625021. The next prime is 466625057. The reversal of 466625053 is 350526664.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 407918809 + 58706244 = 20197^2 + 7662^2 .
It is a cyclic number.
It is not a de Polignac number, because 466625053 - 25 = 466625021 is a prime.
It is a super-3 number, since 3×4666250533 (a number of 27 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (466625057) 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, 233312526 + 233312527.
It is an arithmetic number, because the mean of its divisors is an integer number (233312527).
Almost surely, 2466625053 is an apocalyptic number.
It is an amenable number.
466625053 is a deficient number, since it is larger than the sum of its proper divisors (1).
466625053 is an equidigital number, since it uses as much as digits as its factorization.
466625053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 37.
The square root of 466625053 is about 21601.5058039943. The cubic root of 466625053 is about 775.6325341745.
It can be divided in two parts, 46662 and 5053, that added together give a palindrome (51715).
The spelling of 466625053 in words is "four hundred sixty-six million, six hundred twenty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •