Base | Representation |
---|---|
bin | 10000000000111… |
… | …010100010000000 |
3 | 200201120010002100 |
4 | 100000322202000 |
5 | 1022240101300 |
6 | 42354350400 |
7 | 6441462423 |
oct | 2000724200 |
9 | 621503070 |
10 | 268675200 |
11 | 128729722 |
12 | 75b8b400 |
13 | 43880b11 |
14 | 2797b9ba |
15 | 188c2700 |
hex | 1003a880 |
268675200 has 288 divisors, whose sum is σ = 1011207600. Its totient is φ = 67737600.
The previous prime is 268675153. The next prime is 268675217. The reversal of 268675200 is 2576862.
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 546955 + ... + 547445.
Almost surely, 2268675200 is an apocalyptic number.
268675200 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 268675200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (505603800).
268675200 is an abundant number, since it is smaller than the sum of its proper divisors (742532400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
268675200 is a wasteful number, since it uses less digits than its factorization.
268675200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540 (or 520 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The square root of 268675200 is about 16391.3147733792. The cubic root of 268675200 is about 645.2715640322.
The spelling of 268675200 in words is "two hundred sixty-eight million, six hundred seventy-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •