Base | Representation |
---|---|
bin | 11100111011001… |
… | …110110011101101 |
3 | 1020211011020121222 |
4 | 130323032303231 |
5 | 1443213223242 |
6 | 120053233125 |
7 | 15011614211 |
oct | 3473166355 |
9 | 1224136558 |
10 | 485289197 |
11 | 229a29a58 |
12 | 1166327a5 |
13 | 79704293 |
14 | 48646941 |
15 | 2c90e5d2 |
hex | 1cececed |
485289197 has 2 divisors, whose sum is σ = 485289198. Its totient is φ = 485289196.
The previous prime is 485289187. The next prime is 485289257. The reversal of 485289197 is 791982584.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 478471876 + 6817321 = 21874^2 + 2611^2 .
It is a cyclic number.
It is not a de Polignac number, because 485289197 - 220 = 484240621 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 (485289137) 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, 242644598 + 242644599.
It is an arithmetic number, because the mean of its divisors is an integer number (242644599).
Almost surely, 2485289197 is an apocalyptic number.
It is an amenable number.
485289197 is a deficient number, since it is larger than the sum of its proper divisors (1).
485289197 is an equidigital number, since it uses as much as digits as its factorization.
485289197 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1451520, while the sum is 53.
The square root of 485289197 is about 22029.2804467145. The cubic root of 485289197 is about 785.8389327175.
It can be divided in two parts, 4852 and 89197, that added together give a palindrome (94049).
The spelling of 485289197 in words is "four hundred eighty-five million, two hundred eighty-nine thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •