Base | Representation |
---|---|
bin | 10111111010000… |
… | …11110111111001 |
3 | 111222101022010221 |
4 | 23331003313321 |
5 | 402320243100 |
6 | 31522340041 |
7 | 4653461305 |
oct | 1375036771 |
9 | 458338127 |
10 | 200556025 |
11 | a323278a |
12 | 571ba621 |
13 | 32720407 |
14 | 1c8c8d05 |
15 | 1291901a |
hex | bf43df9 |
200556025 has 12 divisors (see below), whose sum is σ = 257265900. Its totient is φ = 154911680.
The previous prime is 200556023. The next prime is 200556029. The reversal of 200556025 is 520655002.
It can be written as a sum of positive squares in 6 ways, for example, as 7123561 + 193432464 = 2669^2 + 13908^2 .
It is not a de Polignac number, because 200556025 - 21 = 200556023 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (200556023) 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 in 11 ways as a sum of consecutive naturals, for example, 137590 + ... + 139039.
It is an arithmetic number, because the mean of its divisors is an integer number (21438825).
Almost surely, 2200556025 is an apocalyptic number.
200556025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
200556025 is a deficient number, since it is larger than the sum of its proper divisors (56709875).
200556025 is a wasteful number, since it uses less digits than its factorization.
200556025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276668 (or 276663 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 25.
The square root of 200556025 is about 14161.7804318525. The cubic root of 200556025 is about 585.3449885153.
The spelling of 200556025 in words is "two hundred million, five hundred fifty-six thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •