Base | Representation |
---|---|
bin | 11000100110000… |
… | …11001110001101 |
3 | 112101020011112221 |
4 | 30103003032031 |
5 | 410304224100 |
6 | 32250055341 |
7 | 5053460365 |
oct | 1423031615 |
9 | 471204487 |
10 | 206320525 |
11 | a650a734 |
12 | 5911a551 |
13 | 3398b168 |
14 | 1d5899a5 |
15 | 131a701a |
hex | c4c338d |
206320525 has 18 divisors (see below), whose sum is σ = 270023082. Its totient is φ = 156362400.
The previous prime is 206320519. The next prime is 206320559. The reversal of 206320525 is 525023602.
It can be written as a sum of positive squares in 3 ways, for example, as 50495236 + 155825289 = 7106^2 + 12483^2 .
It is not a de Polignac number, because 206320525 - 27 = 206320397 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 206320525.
It is a congruent number.
It is an unprimeable number.
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 in 17 ways as a sum of consecutive naturals, for example, 2406 + ... + 20455.
Almost surely, 2206320525 is an apocalyptic number.
206320525 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
206320525 is a deficient number, since it is larger than the sum of its proper divisors (63702557).
206320525 is a wasteful number, since it uses less digits than its factorization.
206320525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22909 (or 22885 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 206320525 is about 14363.8617718217. The cubic root of 206320525 is about 590.9002105712.
The spelling of 206320525 in words is "two hundred six million, three hundred twenty thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •