Base | Representation |
---|---|
bin | 10000000000011… |
… | …110001101100000 |
3 | 200201100012222001 |
4 | 100000132031200 |
5 | 1022222343300 |
6 | 42352053344 |
7 | 6440500300 |
oct | 2000361540 |
9 | 621305861 |
10 | 268559200 |
11 | 12865a558 |
12 | 75b34254 |
13 | 43840090 |
14 | 2794b600 |
15 | 1889d16a |
hex | 1001e360 |
268559200 has 432 divisors, whose sum is σ = 897692544. Its totient is φ = 77414400.
The previous prime is 268559177. The next prime is 268559219. The reversal of 268559200 is 2955862.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 268559200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 8663185 + ... + 8663215.
It is an arithmetic number, because the mean of its divisors is an integer number (2077992).
Almost surely, 2268559200 is an apocalyptic number.
268559200 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 268559200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (448846272).
268559200 is an abundant number, since it is smaller than the sum of its proper divisors (629133344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268559200 is a wasteful number, since it uses less digits than its factorization.
268559200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95 (or 75 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 37.
The square root of 268559200 is about 16387.7759320782. The cubic root of 268559200 is about 645.1786857460.
The spelling of 268559200 in words is "two hundred sixty-eight million, five hundred fifty-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •