Base | Representation |
---|---|
bin | 1001100111011… |
… | …11110011010000 |
3 | 12121210122220221 |
4 | 10303233303100 |
5 | 131123032000 |
6 | 12001042424 |
7 | 1666501111 |
oct | 463576320 |
9 | 177718827 |
10 | 80674000 |
11 | 415a1630 |
12 | 23026414 |
13 | 139380c4 |
14 | aa00208 |
15 | 713861a |
hex | 4cefcd0 |
80674000 has 160 divisors (see below), whose sum is σ = 225164160. Its totient is φ = 27648000.
The previous prime is 80673991. The next prime is 80674001. The reversal of 80674000 is 47608.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80674001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 417904 + ... + 418096.
It is an arithmetic number, because the mean of its divisors is an integer number (1407276).
Almost surely, 280674000 is an apocalyptic number.
80674000 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 80674000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112582080).
80674000 is an abundant number, since it is smaller than the sum of its proper divisors (144490160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80674000 is a wasteful number, since it uses less digits than its factorization.
80674000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246 (or 230 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 25.
The square root of 80674000 is about 8981.8706292175. The cubic root of 80674000 is about 432.0936296828.
The spelling of 80674000 in words is "eighty million, six hundred seventy-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •