Base | Representation |
---|---|
bin | 10010001110000101010011… |
… | …100000010101010000000101 |
3 | 101111201121021002002221120211 |
4 | 102032011103200111100011 |
5 | 41000343034042413203 |
6 | 442232224431355421 |
7 | 22610250450052234 |
oct | 2216052340252005 |
9 | 344647232087524 |
10 | 80132605826053 |
11 | 23595057a32a20 |
12 | 8ba229b682b71 |
13 | 359361a869751 |
14 | 15b062017ab1b |
15 | 93e67642dc6d |
hex | 48e153815405 |
80132605826053 has 16 divisors (see below), whose sum is σ = 87735113908416. Its totient is φ = 72583103859840.
The previous prime is 80132605826051. The next prime is 80132605826123. The reversal of 80132605826053 is 35062850623108.
It is a cyclic number.
It is not a de Polignac number, because 80132605826053 - 21 = 80132605826051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 80132605825988 and 80132605826006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80132605826051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29755401 + ... + 32336497.
It is an arithmetic number, because the mean of its divisors is an integer number (5483444619276).
Almost surely, 280132605826053 is an apocalyptic number.
It is an amenable number.
80132605826053 is a deficient number, since it is larger than the sum of its proper divisors (7602508082363).
80132605826053 is a wasteful number, since it uses less digits than its factorization.
80132605826053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2591364.
The product of its (nonzero) digits is 2073600, while the sum is 49.
The spelling of 80132605826053 in words is "eighty trillion, one hundred thirty-two billion, six hundred five million, eight hundred twenty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •