Base | Representation |
---|---|
bin | 11100111011111… |
… | …110110000100001 |
3 | 1020211112020001012 |
4 | 130323332300201 |
5 | 1443241014401 |
6 | 120101350305 |
7 | 15013362626 |
oct | 3473766041 |
9 | 1224466035 |
10 | 485485601 |
11 | 22a053577 |
12 | 116708395 |
13 | 797727b3 |
14 | 4869834d |
15 | 2c94c8bb |
hex | 1cefec21 |
485485601 has 2 divisors, whose sum is σ = 485485602. Its totient is φ = 485485600.
The previous prime is 485485591. The next prime is 485485603. The reversal of 485485601 is 106584584.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 485056576 + 429025 = 22024^2 + 655^2 .
It is a cyclic number.
It is not a de Polignac number, because 485485601 - 26 = 485485537 is a prime.
It is a Sophie Germain prime.
Together with 485485603, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (485485603) 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, 242742800 + 242742801.
It is an arithmetic number, because the mean of its divisors is an integer number (242742801).
Almost surely, 2485485601 is an apocalyptic number.
It is an amenable number.
485485601 is a deficient number, since it is larger than the sum of its proper divisors (1).
485485601 is an equidigital number, since it uses as much as digits as its factorization.
485485601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 153600, while the sum is 41.
The square root of 485485601 is about 22033.7377900346. The cubic root of 485485601 is about 785.9449321187.
The spelling of 485485601 in words is "four hundred eighty-five million, four hundred eighty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •