Base | Representation |
---|---|
bin | 11000011001011… |
… | …00000000100100 |
3 | 112021002102120012 |
4 | 30030230000210 |
5 | 404342340310 |
6 | 32150225352 |
7 | 5033342516 |
oct | 1414540044 |
9 | 467072505 |
10 | 204652580 |
11 | a5580570 |
12 | 58655258 |
13 | 33525c02 |
14 | 1d273bb6 |
15 | 12e77c05 |
hex | c32c024 |
204652580 has 48 divisors (see below), whose sum is σ = 475300224. Its totient is φ = 73393920.
The previous prime is 204652577. The next prime is 204652631. The reversal of 204652580 is 85256402.
204652580 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9689 + ... + 22431.
It is an arithmetic number, because the mean of its divisors is an integer number (9902088).
Almost surely, 2204652580 is an apocalyptic number.
204652580 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 204652580, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (237650112).
204652580 is an abundant number, since it is smaller than the sum of its proper divisors (270647644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204652580 is a wasteful number, since it uses less digits than its factorization.
204652580 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12836 (or 12834 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 32.
The square root of 204652580 is about 14305.6834859436. The cubic root of 204652580 is about 589.3035735617.
The spelling of 204652580 in words is "two hundred four million, six hundred fifty-two thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •