Base | Representation |
---|---|
bin | 11000011000000… |
… | …11000110110000 |
3 | 112020202220202000 |
4 | 30030003012300 |
5 | 404322010130 |
6 | 32142454000 |
7 | 5032044204 |
oct | 1414030660 |
9 | 466686660 |
10 | 204485040 |
11 | a5476701 |
12 | 58594300 |
13 | 33497886 |
14 | 1d22cb04 |
15 | 12e43260 |
hex | c3031b0 |
204485040 has 160 divisors (see below), whose sum is σ = 721828800. Its totient is φ = 53176320.
The previous prime is 204485023. The next prime is 204485053. The reversal of 204485040 is 40584402.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 204484995 and 204485013.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 87406 + ... + 89714.
It is an arithmetic number, because the mean of its divisors is an integer number (4511430).
Almost surely, 2204485040 is an apocalyptic number.
204485040 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 204485040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (360914400).
204485040 is an abundant number, since it is smaller than the sum of its proper divisors (517343760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204485040 is a wasteful number, since it uses less digits than its factorization.
204485040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2372 (or 2360 counting only the distinct ones).
The product of its (nonzero) digits is 5120, while the sum is 27.
The square root of 204485040 is about 14299.8265723749. The cubic root of 204485040 is about 589.1427174163.
The spelling of 204485040 in words is "two hundred four million, four hundred eighty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •