Base | Representation |
---|---|
bin | 11100111011100… |
… | …111100011100111 |
3 | 1020211100101200102 |
4 | 130323213203213 |
5 | 1443224444232 |
6 | 120055334315 |
7 | 15012515564 |
oct | 3473474347 |
9 | 1224311612 |
10 | 485390567 |
11 | 229a99132 |
12 | 11668139b |
13 | 7973b46c |
14 | 4867186b |
15 | 2c92e662 |
hex | 1cee78e7 |
485390567 has 2 divisors, whose sum is σ = 485390568. Its totient is φ = 485390566.
The previous prime is 485390533. The next prime is 485390621. The reversal of 485390567 is 765093584.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 485390567 - 210 = 485389543 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (485390527) 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, 242695283 + 242695284.
It is an arithmetic number, because the mean of its divisors is an integer number (242695284).
Almost surely, 2485390567 is an apocalyptic number.
485390567 is a deficient number, since it is larger than the sum of its proper divisors (1).
485390567 is an equidigital number, since it uses as much as digits as its factorization.
485390567 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 907200, while the sum is 47.
The square root of 485390567 is about 22031.5811280080. The cubic root of 485390567 is about 785.8936457608.
The spelling of 485390567 in words is "four hundred eighty-five million, three hundred ninety thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •