Base | Representation |
---|---|
bin | 11000011010011… |
… | …00100110100000 |
3 | 112021100012200122 |
4 | 30031030212200 |
5 | 404411123310 |
6 | 32153135412 |
7 | 5034436652 |
oct | 1415144640 |
9 | 467305618 |
10 | 204786080 |
11 | a56618a4 |
12 | 586ba568 |
13 | 335718c5 |
14 | 1d2aa6d2 |
15 | 12ea2555 |
hex | c34c9a0 |
204786080 has 48 divisors (see below), whose sum is σ = 512273160. Its totient is φ = 77094912.
The previous prime is 204786079. The next prime is 204786119. The reversal of 204786080 is 80687402.
204786080 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 169312144 + 35473936 = 13012^2 + 5956^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 204786080.
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 7 ways as a sum of consecutive naturals, for example, 34925 + ... + 40364.
Almost surely, 2204786080 is an apocalyptic number.
204786080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
204786080 is an abundant number, since it is smaller than the sum of its proper divisors (307487080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204786080 is a wasteful number, since it uses less digits than its factorization.
204786080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75321 (or 75313 counting only the distinct ones).
The product of its (nonzero) digits is 21504, while the sum is 35.
The square root of 204786080 is about 14310.3487029492. The cubic root of 204786080 is about 589.4316848657.
The spelling of 204786080 in words is "two hundred four million, seven hundred eighty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •