Base | Representation |
---|---|
bin | 11000010110100… |
… | …10101011000000 |
3 | 112020101211121110 |
4 | 30023102223000 |
5 | 404244133111 |
6 | 32134323320 |
7 | 5030256630 |
oct | 1413225300 |
9 | 466354543 |
10 | 204286656 |
11 | a5350652 |
12 | 584b9540 |
13 | 334284a2 |
14 | 1d1ba6c0 |
15 | 12e045a6 |
hex | c2d2ac0 |
204286656 has 112 divisors (see below), whose sum is σ = 624490496. Its totient is φ = 57729024.
The previous prime is 204286639. The next prime is 204286681. The reversal of 204286656 is 656682402.
It is a tau number, because it is divible by the number of its divisors (112).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 129585 + ... + 131151.
It is an arithmetic number, because the mean of its divisors is an integer number (5575808).
Almost surely, 2204286656 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 204286656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (312245248).
204286656 is an abundant number, since it is smaller than the sum of its proper divisors (420203840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204286656 is a wasteful number, since it uses less digits than its factorization.
204286656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1686 (or 1676 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 39.
The square root of 204286656 is about 14292.8883015295. Note that the first 3 decimals coincide. The cubic root of 204286656 is about 588.9521341090.
The spelling of 204286656 in words is "two hundred four million, two hundred eighty-six thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •