Base | Representation |
---|---|
bin | 1001100101000… |
… | …10001011110000 |
3 | 12121012111211010 |
4 | 10302202023300 |
5 | 131032343310 |
6 | 11550150520 |
7 | 1664005200 |
oct | 462421360 |
9 | 177174733 |
10 | 80356080 |
11 | 413a4792 |
12 | 22ab2440 |
13 | 1385649c |
14 | a95a400 |
15 | 70c4320 |
hex | 4ca22f0 |
80356080 has 120 divisors (see below), whose sum is σ = 289816272. Its totient is φ = 18364416.
The previous prime is 80356079. The next prime is 80356091. The reversal of 80356080 is 8065308.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8344 + ... + 15176.
Almost surely, 280356080 is an apocalyptic number.
80356080 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 80356080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144908136).
80356080 is an abundant number, since it is smaller than the sum of its proper divisors (209460192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80356080 is a wasteful number, since it uses less digits than its factorization.
80356080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6863 (or 6850 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The square root of 80356080 is about 8964.1552864729. The cubic root of 80356080 is about 431.5252844348.
The spelling of 80356080 in words is "eighty million, three hundred fifty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •