Base | Representation |
---|---|
bin | 11111100001011… |
… | …01110100000000 |
3 | 200102120101010021 |
4 | 33300231310000 |
5 | 1020143210200 |
6 | 42123343224 |
7 | 6360415306 |
oct | 1760556400 |
9 | 612511107 |
10 | 264428800 |
11 | 1262992a9 |
12 | 74681b14 |
13 | 42a2505c |
14 | 27194276 |
15 | 1833441a |
hex | fc2dd00 |
264428800 has 108 divisors (see below), whose sum is σ = 664054720. Its totient is φ = 104232960.
The previous prime is 264428797. The next prime is 264428809. The reversal of 264428800 is 8824462.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (264428809) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 505339 + ... + 505861.
Almost surely, 2264428800 is an apocalyptic number.
264428800 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 264428800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (332027360).
264428800 is an abundant number, since it is smaller than the sum of its proper divisors (399625920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
264428800 is an equidigital number, since it uses as much as digits as its factorization.
264428800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628 (or 609 counting only the distinct ones).
The product of its (nonzero) digits is 24576, while the sum is 34.
The square root of 264428800 is about 16261.2668633166. The cubic root of 264428800 is about 641.8539990133.
The spelling of 264428800 in words is "two hundred sixty-four million, four hundred twenty-eight thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •