Base | Representation |
---|---|
bin | 11011011001111… |
… | …110101001101101 |
3 | 1012001012000020102 |
4 | 123121332221231 |
5 | 1420201420203 |
6 | 113343000445 |
7 | 14252123234 |
oct | 3331765155 |
9 | 1161160212 |
10 | 459795053 |
11 | 2165a6913 |
12 | 109b99125 |
13 | 743491a3 |
14 | 450cbb1b |
15 | 2a575888 |
hex | 1b67ea6d |
459795053 has 2 divisors, whose sum is σ = 459795054. Its totient is φ = 459795052.
The previous prime is 459795043. The next prime is 459795101. The reversal of 459795053 is 350597954.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 442597444 + 17197609 = 21038^2 + 4147^2 .
It is a cyclic number.
It is not a de Polignac number, because 459795053 - 26 = 459794989 is a prime.
It is a super-2 number, since 2×4597950532 = 422822981526545618, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 459794989 and 459795007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (459795023) 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, 229897526 + 229897527.
It is an arithmetic number, because the mean of its divisors is an integer number (229897527).
Almost surely, 2459795053 is an apocalyptic number.
It is an amenable number.
459795053 is a deficient number, since it is larger than the sum of its proper divisors (1).
459795053 is an equidigital number, since it uses as much as digits as its factorization.
459795053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 850500, while the sum is 47.
The square root of 459795053 is about 21442.8322056579. The cubic root of 459795053 is about 771.8296026735.
The spelling of 459795053 in words is "four hundred fifty-nine million, seven hundred ninety-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •