Base | Representation |
---|---|
bin | 11100111010110… |
… | …010000000000001 |
3 | 1020210221020202202 |
4 | 130322302000001 |
5 | 1443200434301 |
6 | 120050522545 |
7 | 15010613204 |
oct | 3472620001 |
9 | 1223836682 |
10 | 485171201 |
11 | 229959339 |
12 | 116596455 |
13 | 79692668 |
14 | 4861593b |
15 | 2c8d966b |
hex | 1ceb2001 |
485171201 has 2 divisors, whose sum is σ = 485171202. Its totient is φ = 485171200.
The previous prime is 485171191. The next prime is 485171209. The reversal of 485171201 is 102171584.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 336355600 + 148815601 = 18340^2 + 12199^2 .
It is a cyclic number.
It is not a de Polignac number, because 485171201 - 210 = 485170177 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (485171209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 242585600 + 242585601.
It is an arithmetic number, because the mean of its divisors is an integer number (242585601).
Almost surely, 2485171201 is an apocalyptic number.
It is an amenable number.
485171201 is a deficient number, since it is larger than the sum of its proper divisors (1).
485171201 is an equidigital number, since it uses as much as digits as its factorization.
485171201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2240, while the sum is 29.
The square root of 485171201 is about 22026.6021210717. The cubic root of 485171201 is about 785.7752364256.
The spelling of 485171201 in words is "four hundred eighty-five million, one hundred seventy-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •