Base | Representation |
---|---|
bin | 1001100111010… |
… | …00001011110000 |
3 | 12121202002010101 |
4 | 10303220023300 |
5 | 131121032200 |
6 | 12000242144 |
7 | 1666311130 |
oct | 463501360 |
9 | 177662111 |
10 | 80642800 |
11 | 41580147 |
12 | 23010354 |
13 | 13926b44 |
14 | a9d2ac0 |
15 | 712e26a |
hex | 4ce82f0 |
80642800 has 120 divisors (see below), whose sum is σ = 224735616. Its totient is φ = 27237120.
The previous prime is 80642773. The next prime is 80642803. The reversal of 80642800 is 824608.
It is a super-2 number, since 2×806428002 = 13006522383680000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80642803) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 232227 + ... + 232573.
Almost surely, 280642800 is an apocalyptic number.
80642800 is a gapful number since it is divisible by the number (80) 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 80642800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112367808).
80642800 is an abundant number, since it is smaller than the sum of its proper divisors (144092816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80642800 is a wasteful number, since it uses less digits than its factorization.
80642800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 455 (or 444 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 28.
The square root of 80642800 is about 8980.1336292953. The cubic root of 80642800 is about 432.0379196253.
The spelling of 80642800 in words is "eighty million, six hundred forty-two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •