Base | Representation |
---|---|
bin | 100101101000110100… |
… | …0100101110010010000 |
3 | 21201121221022010010201 |
4 | 1023101220211302100 |
5 | 2311013040140000 |
6 | 101044200104544 |
7 | 5560645554304 |
oct | 1132150456220 |
9 | 251557263121 |
10 | 80826490000 |
11 | 313074a0273 |
12 | 137b8765154 |
13 | 7811431159 |
14 | 3caa83bd04 |
15 | 2180d2996a |
hex | 12d1a25c90 |
80826490000 has 75 divisors (see below), whose sum is σ = 195757871023. Its totient is φ = 32319224000.
The previous prime is 80826489967. The next prime is 80826490007. The reversal of 80826490000 is 9462808.
The square root of 80826490000 is 284300.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 6336796816 + 74489693184 = 79604^2 + 272928^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (80826490007) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 28428579 + ... + 28431421.
Almost surely, 280826490000 is an apocalyptic number.
80826490000 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
80826490000 is the 284300-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 80826490000
80826490000 is an abundant number, since it is smaller than the sum of its proper divisors (114931381023).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80826490000 is an frugal number, since it uses more digits than its factorization.
80826490000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5714 (or 2850 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 37.
The spelling of 80826490000 in words is "eighty billion, eight hundred twenty-six million, four hundred ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •