Base | Representation |
---|---|
bin | 100101101101010011… |
… | …0111011000000110110 |
3 | 21202000102121020100100 |
4 | 1023122212323000312 |
5 | 2311320111010411 |
6 | 101111135054530 |
7 | 5564454355620 |
oct | 1133246730066 |
9 | 252012536310 |
10 | 80977047606 |
11 | 31384483444 |
12 | 1383b071446 |
13 | 7836696ab0 |
14 | 3cc282dc10 |
15 | 218e169456 |
hex | 12da9bb036 |
80977047606 has 192 divisors, whose sum is σ = 234639175680. Its totient is φ = 19579656960.
The previous prime is 80977047533. The next prime is 80977047607. The reversal of 80977047606 is 60674077908.
80977047606 is a `hidden beast` number, since 80 + 97 + 7 + 0 + 476 + 0 + 6 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80977047607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 922816 + ... + 1006748.
It is an arithmetic number, because the mean of its divisors is an integer number (1222079040).
Almost surely, 280977047606 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 80977047606, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117319587840).
80977047606 is an abundant number, since it is smaller than the sum of its proper divisors (153662128074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80977047606 is a wasteful number, since it uses less digits than its factorization.
80977047606 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84011 (or 84008 counting only the distinct ones).
The product of its (nonzero) digits is 3556224, while the sum is 54.
The spelling of 80977047606 in words is "eighty billion, nine hundred seventy-seven million, forty-seven thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •