Base | Representation |
---|---|
bin | 11000111100011… |
… | …10011011010000 |
3 | 112120202000001000 |
4 | 30132032123100 |
5 | 412032000000 |
6 | 32432542000 |
7 | 5120411211 |
oct | 1436163320 |
9 | 476660030 |
10 | 209250000 |
11 | a8130693 |
12 | 5a0b1900 |
13 | 3447568b |
14 | 1db0d408 |
15 | 13585000 |
hex | c78e6d0 |
209250000 has 280 divisors, whose sum is σ = 774990080. Its totient is φ = 54000000.
The previous prime is 209249987. The next prime is 209250001. The reversal of 209250000 is 52902.
209250000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (209250001) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 6749985 + ... + 6750015.
Almost surely, 2209250000 is an apocalyptic number.
209250000 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 209250000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (387495040).
209250000 is an abundant number, since it is smaller than the sum of its proper divisors (565740080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
209250000 is an frugal number, since it uses more digits than its factorization.
209250000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78 (or 41 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 209250000 is about 14465.4761414894. The cubic root of 209250000 is about 593.6837414521.
The spelling of 209250000 in words is "two hundred nine million, two hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •