Base | Representation |
---|---|
bin | 1100000001101010000… |
… | …0110110101011100000 |
3 | 201202021112110120011001 |
4 | 3000122200312223200 |
5 | 11341110413003100 |
6 | 234525012401344 |
7 | 20632551436621 |
oct | 3003240665340 |
9 | 652245416131 |
10 | 206603250400 |
11 | 7a69016aa38 |
12 | 3405b016254 |
13 | 16637381131 |
14 | 9ddd081a48 |
15 | 559301cd6a |
hex | 301a836ae0 |
206603250400 has 144 divisors (see below), whose sum is σ = 511537572000. Its totient is φ = 81474140160.
The previous prime is 206603250389. The next prime is 206603250407. The reversal of 206603250400 is 4052306602.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206603250407) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18864126 + ... + 18875074.
It is an arithmetic number, because the mean of its divisors is an integer number (3552344250).
Almost surely, 2206603250400 is an apocalyptic number.
206603250400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 206603250400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (255768786000).
206603250400 is an abundant number, since it is smaller than the sum of its proper divisors (304934321600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206603250400 is a wasteful number, since it uses less digits than its factorization.
206603250400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11301 (or 11288 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 28.
The spelling of 206603250400 in words is "two hundred six billion, six hundred three million, two hundred fifty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •