Base | Representation |
---|---|
bin | 1001100010101… |
… | …11011101010000 |
3 | 12120121221221211 |
4 | 10301113131100 |
5 | 130443100000 |
6 | 11535425504 |
7 | 1661261632 |
oct | 461273520 |
9 | 176557854 |
10 | 80050000 |
11 | 41205828 |
12 | 22985294 |
13 | 1377a084 |
14 | a8baa52 |
15 | 70637ba |
hex | 4c57750 |
80050000 has 60 divisors (see below), whose sum is σ = 193979772. Its totient is φ = 32000000.
The previous prime is 80049997. The next prime is 80050013. The reversal of 80050000 is 5008.
It can be written as a sum of positive squares in 6 ways, for example, as 38987536 + 41062464 = 6244^2 + 6408^2 .
It is a congruent number.
It is an unprimeable number.
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, 49200 + ... + 50800.
Almost surely, 280050000 is an apocalyptic number.
80050000 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 80050000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (96989886).
80050000 is an abundant number, since it is smaller than the sum of its proper divisors (113929772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80050000 is an equidigital number, since it uses as much as digits as its factorization.
80050000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1634 (or 1608 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 80050000 is about 8947.0665583754. The cubic root of 80050000 is about 430.9766874233.
Adding to 80050000 its reverse (5008), we get a palindrome (80055008).
The spelling of 80050000 in words is "eighty million, fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •