Base | Representation |
---|---|
bin | 110101011011111… |
… | …110001110001101 |
3 | 2022110222012100221 |
4 | 311123332032031 |
5 | 3314002301242 |
6 | 224543351341 |
7 | 31134224041 |
oct | 6533761615 |
9 | 2273865327 |
10 | 896525197 |
11 | 420079717 |
12 | 2102b2551 |
13 | 11397aba9 |
14 | 870d4021 |
15 | 53a92167 |
hex | 356fe38d |
896525197 has 2 divisors, whose sum is σ = 896525198. Its totient is φ = 896525196.
The previous prime is 896525173. The next prime is 896525221. The reversal of 896525197 is 791525698.
It is a balanced prime because it is at equal distance from previous prime (896525173) and next prime (896525221).
It can be written as a sum of positive squares in only one way, i.e., 896343721 + 181476 = 29939^2 + 426^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-896525197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (896525117) 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, 448262598 + 448262599.
It is an arithmetic number, because the mean of its divisors is an integer number (448262599).
Almost surely, 2896525197 is an apocalyptic number.
It is an amenable number.
896525197 is a deficient number, since it is larger than the sum of its proper divisors (1).
896525197 is an equidigital number, since it uses as much as digits as its factorization.
896525197 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1360800, while the sum is 52.
The square root of 896525197 is about 29942.0306091621. The cubic root of 896525197 is about 964.2452318975.
It can be divided in two parts, 89652 and 5197, that added together give a palindrome (94849).
The spelling of 896525197 in words is "eight hundred ninety-six million, five hundred twenty-five thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •