Base | Representation |
---|---|
bin | 10010001101010110110010… |
… | …101100100101000110001001 |
3 | 101111112211100111100221220101 |
4 | 102031112302230211012021 |
5 | 40444033243243432044 |
6 | 442153245001125401 |
7 | 22603532023225033 |
oct | 2215266254450611 |
9 | 344484314327811 |
10 | 80082663264649 |
11 | 23575959731391 |
12 | 8b94681a89861 |
13 | 358b9bb98ab76 |
14 | 15ac04331cc53 |
15 | 93d201b32cd4 |
hex | 48d5b2b25189 |
80082663264649 has 4 divisors (see below), whose sum is σ = 80658797532880. Its totient is φ = 79506528996420.
The previous prime is 80082663264641. The next prime is 80082663264677. The reversal of 80082663264649 is 94646236628008.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 80082663264649 - 23 = 80082663264641 is a prime.
It is a super-2 number, since 2×800826632646492 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (80082663264641) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 288067133907 + ... + 288067134184.
It is an arithmetic number, because the mean of its divisors is an integer number (20164699383220).
Almost surely, 280082663264649 is an apocalyptic number.
It is an amenable number.
80082663264649 is a deficient number, since it is larger than the sum of its proper divisors (576134268231).
80082663264649 is a wasteful number, since it uses less digits than its factorization.
80082663264649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576134268230.
The product of its (nonzero) digits is 143327232, while the sum is 64.
The spelling of 80082663264649 in words is "eighty trillion, eighty-two billion, six hundred sixty-three million, two hundred sixty-four thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •