Base | Representation |
---|---|
bin | 11000010100110… |
… | …10100110000000 |
3 | 112012222011112012 |
4 | 30022122212000 |
5 | 404214310320 |
6 | 32125352052 |
7 | 5025312152 |
oct | 1412324600 |
9 | 465864465 |
10 | 204056960 |
11 | a5204018 |
12 | 58408628 |
13 | 33377a83 |
14 | 1d15aad2 |
15 | 12dab4c5 |
hex | c29a980 |
204056960 has 128 divisors (see below), whose sum is σ = 521791200. Its totient is φ = 76087296.
The previous prime is 204056953. The next prime is 204056969. The reversal of 204056960 is 69650402.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204056969) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1179434 + ... + 1179606.
Almost surely, 2204056960 is an apocalyptic number.
204056960 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 204056960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (260895600).
204056960 is an abundant number, since it is smaller than the sum of its proper divisors (317734240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204056960 is a wasteful number, since it uses less digits than its factorization.
204056960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 308 (or 296 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 204056960 is about 14284.8507167558. The cubic root of 204056960 is about 588.7313158304.
The spelling of 204056960 in words is "two hundred four million, fifty-six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •