Base | Representation |
---|---|
bin | 10010010101100011100110… |
… | …011010000110110000000000 |
3 | 101120112200212100121222110010 |
4 | 102111203212122012300000 |
5 | 41032301324404142033 |
6 | 443304201215304520 |
7 | 22662331211521353 |
oct | 2225434632066000 |
9 | 346480770558403 |
10 | 80646171552768 |
11 | 23772938444708 |
12 | 906592781b140 |
13 | 35ccb94344a43 |
14 | 15cb41cd1029a |
15 | 94cbd2eb1863 |
hex | 4958e6686c00 |
80646171552768 has 352 divisors, whose sum is σ = 225252011008000. Its totient is φ = 25621813002240.
The previous prime is 80646171552757. The next prime is 80646171552797. The reversal of 80646171552768 is 86725517164608.
It is a super-2 number, since 2×806461715527682 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 80646171552699 and 80646171552708.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3077028048 + ... + 3077054256.
Almost surely, 280646171552768 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 80646171552768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112626005504000).
80646171552768 is an abundant number, since it is smaller than the sum of its proper divisors (144605839455232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80646171552768 is a wasteful number, since it uses less digits than its factorization.
80646171552768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26751 (or 26733 counting only the distinct ones).
The product of its (nonzero) digits is 135475200, while the sum is 66.
The spelling of 80646171552768 in words is "eighty trillion, six hundred forty-six billion, one hundred seventy-one million, five hundred fifty-two thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •