Base | Representation |
---|---|
bin | 10111111010000… |
… | …11000000110001 |
3 | 111222101010022021 |
4 | 23331003000301 |
5 | 402320134442 |
6 | 31522311441 |
7 | 4653445105 |
oct | 1375030061 |
9 | 458333267 |
10 | 200552497 |
11 | a3230072 |
12 | 571b8581 |
13 | 3271b922 |
14 | 1c8c7905 |
15 | 12917e67 |
hex | bf43031 |
200552497 has 2 divisors, whose sum is σ = 200552498. Its totient is φ = 200552496.
The previous prime is 200552459. The next prime is 200552533. The reversal of 200552497 is 794255002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 164839921 + 35712576 = 12839^2 + 5976^2 .
It is a cyclic number.
It is not a de Polignac number, because 200552497 - 27 = 200552369 is a prime.
It is equal to p11107897 and since 200552497 and 11107897 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (200552437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100276248 + 100276249.
It is an arithmetic number, because the mean of its divisors is an integer number (100276249).
Almost surely, 2200552497 is an apocalyptic number.
It is an amenable number.
200552497 is a deficient number, since it is larger than the sum of its proper divisors (1).
200552497 is an equidigital number, since it uses as much as digits as its factorization.
200552497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25200, while the sum is 34.
The square root of 200552497 is about 14161.6558706953. The cubic root of 200552497 is about 585.3415562089.
The spelling of 200552497 in words is "two hundred million, five hundred fifty-two thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •