Base | Representation |
---|---|
bin | 1001101001111… |
… | …01111011011100 |
3 | 12122101220220020 |
4 | 10310331323130 |
5 | 131213302022 |
6 | 12011552140 |
7 | 2002303101 |
oct | 464757334 |
9 | 178356806 |
10 | 80994012 |
11 | 417a0000 |
12 | 2315b650 |
13 | 13a1a968 |
14 | aa84aa8 |
15 | 719d35c |
hex | 4d3dedc |
80994012 has 60 divisors (see below), whose sum is σ = 208334280. Its totient is φ = 24490400.
The previous prime is 80994007. The next prime is 80994029. The reversal of 80994012 is 21049908.
It is a super-2 number, since 2×809940122 = 13120059959712288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 175462 + ... + 175922.
It is an arithmetic number, because the mean of its divisors is an integer number (3472238).
Almost surely, 280994012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 80994012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (104167140).
80994012 is an abundant number, since it is smaller than the sum of its proper divisors (127340268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80994012 is a wasteful number, since it uses less digits than its factorization.
80994012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 512 (or 477 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 33.
The square root of 80994012 is about 8999.6673271849. The cubic root of 80994012 is about 432.6642088660.
The spelling of 80994012 in words is "eighty million, nine hundred ninety-four thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •