Base | Representation |
---|---|
bin | 11000011101111… |
… | …00101100010000 |
3 | 112022012112111002 |
4 | 30032330230100 |
5 | 410020321300 |
6 | 32211041132 |
7 | 5041361336 |
oct | 1416745420 |
9 | 468175432 |
10 | 205245200 |
11 | a5945836 |
12 | 588a01a8 |
13 | 336a2884 |
14 | 1d389b56 |
15 | 130435d5 |
hex | c3bcb10 |
205245200 has 60 divisors (see below), whose sum is σ = 495230208. Its totient is φ = 81744000.
The previous prime is 205245197. The next prime is 205245211. The reversal of 205245200 is 2542502.
It is a Harshad number since it is a multiple of its sum of digits (20).
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 11 ways as a sum of consecutive naturals, for example, 104225 + ... + 106175.
Almost surely, 2205245200 is an apocalyptic number.
205245200 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 205245200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (247615104).
205245200 is an abundant number, since it is smaller than the sum of its proper divisors (289985008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
205245200 is a wasteful number, since it uses less digits than its factorization.
205245200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2232 (or 2221 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 20.
The square root of 205245200 is about 14326.3812597599. The cubic root of 205245200 is about 589.8718480643.
Adding to 205245200 its reverse (2542502), we get a palindrome (207787702).
The spelling of 205245200 in words is "two hundred five million, two hundred forty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •