Base | Representation |
---|---|
bin | 10010001101010100111111… |
… | …010110011101100010000101 |
3 | 101111112122100121222201202120 |
4 | 102031110333112131202011 |
5 | 40444020312342233121 |
6 | 442152324551400153 |
7 | 22603433044412511 |
oct | 2215247726354205 |
9 | 344478317881676 |
10 | 80080728086661 |
11 | 23575056339535 |
12 | 8b94221983059 |
13 | 358b770a8b533 |
14 | 15abcdc2d9141 |
15 | 93d13bcc6bc6 |
hex | 48d53f59d885 |
80080728086661 has 8 divisors (see below), whose sum is σ = 106830294843744. Its totient is φ = 53359156693680.
The previous prime is 80080728086507. The next prime is 80080728086663. The reversal of 80080728086661 is 16668082708008.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 80080728086661 - 211 = 80080728084613 is a prime.
It is a super-2 number, since 2×800807280866612 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 80080728086595 and 80080728086604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80080728086663) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6998834350 + ... + 6998845791.
It is an arithmetic number, because the mean of its divisors is an integer number (13353786855468).
Almost surely, 280080728086661 is an apocalyptic number.
It is an amenable number.
80080728086661 is a deficient number, since it is larger than the sum of its proper divisors (26749566757083).
80080728086661 is a wasteful number, since it uses less digits than its factorization.
80080728086661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13997682051.
The product of its (nonzero) digits is 12386304, while the sum is 60.
The spelling of 80080728086661 in words is "eighty trillion, eighty billion, seven hundred twenty-eight million, eighty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •