Base | Representation |
---|---|
bin | 100000000000101… |
… | …0010110000100000 |
3 | 2202212001221212101 |
4 | 1000001102300200 |
5 | 4144431041200 |
6 | 254325140144 |
7 | 35421351622 |
oct | 10001226040 |
9 | 2685057771 |
10 | 1074080800 |
11 | 501321891 |
12 | 25b85a654 |
13 | 1416a7290 |
14 | a2912c12 |
15 | 6446626a |
hex | 40052c20 |
1074080800 has 144 divisors (see below), whose sum is σ = 2847942720. Its totient is φ = 393200640.
The previous prime is 1074080759. The next prime is 1074080857. The reversal of 1074080800 is 80804701.
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 23 ways as a sum of consecutive naturals, for example, 1445229 + ... + 1445971.
It is an arithmetic number, because the mean of its divisors is an integer number (19777380).
Almost surely, 21074080800 is an apocalyptic number.
1074080800 is a gapful number since it is divisible by the number (10) 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 1074080800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1423971360).
1074080800 is an abundant number, since it is smaller than the sum of its proper divisors (1773861920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1074080800 is a wasteful number, since it uses less digits than its factorization.
1074080800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 915 (or 902 counting only the distinct ones).
The product of its (nonzero) digits is 1792, while the sum is 28.
The square root of 1074080800 is about 32773.1719551221. The cubic root of 1074080800 is about 1024.1077462308.
The spelling of 1074080800 in words is "one billion, seventy-four million, eighty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •