Base | Representation |
---|---|
bin | 11000011001011… |
… | …11111100010000 |
3 | 112021010020122210 |
4 | 30030233330100 |
5 | 404343344223 |
6 | 32150432120 |
7 | 5033440500 |
oct | 1414577420 |
9 | 467106583 |
10 | 204668688 |
11 | a5591684 |
12 | 58662640 |
13 | 33530343 |
14 | 1d279a00 |
15 | 12e7c893 |
hex | c32ff10 |
204668688 has 120 divisors (see below), whose sum is σ = 619835328. Its totient is φ = 58023168.
The previous prime is 204668677. The next prime is 204668693. The reversal of 204668688 is 886866402.
It is a happy number.
204668688 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 406645 + ... + 407147.
Almost surely, 2204668688 is an apocalyptic number.
204668688 is a gapful number since it is divisible by the number (28) 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 204668688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (309917664).
204668688 is an abundant number, since it is smaller than the sum of its proper divisors (415166640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204668688 is a wasteful number, since it uses less digits than its factorization.
204668688 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 701 (or 688 counting only the distinct ones).
The product of its (nonzero) digits is 884736, while the sum is 48.
The square root of 204668688 is about 14306.2464678895. The cubic root of 204668688 is about 589.3190343211.
The spelling of 204668688 in words is "two hundred four million, six hundred sixty-eight thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •