Base | Representation |
---|---|
bin | 10010010001000000101000… |
… | …100001010110101011100001 |
3 | 101112102211110000212000122222 |
4 | 102101000220201112223201 |
5 | 41012142004010333143 |
6 | 442504451525240425 |
7 | 22630631111353013 |
oct | 2221005041265341 |
9 | 345384400760588 |
10 | 80333748136673 |
11 | 23662395587a89 |
12 | 9015275863115 |
13 | 35a9594731a65 |
14 | 15ba261c521b3 |
15 | 9449e9ce5768 |
hex | 491028856ae1 |
80333748136673 has 16 divisors (see below), whose sum is σ = 83331703175424. Its totient is φ = 77391299715840.
The previous prime is 80333748136643. The next prime is 80333748136687. The reversal of 80333748136673 is 37663184733308.
It is a cyclic number.
It is not a de Polignac number, because 80333748136673 - 210 = 80333748135649 is a prime.
It is a super-2 number, since 2×803337481366732 (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 (80333748136633) 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, 5750318 + ... + 13918823.
It is an arithmetic number, because the mean of its divisors is an integer number (5208231448464).
Almost surely, 280333748136673 is an apocalyptic number.
It is an amenable number.
80333748136673 is a deficient number, since it is larger than the sum of its proper divisors (2997955038751).
80333748136673 is a wasteful number, since it uses less digits than its factorization.
80333748136673 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19670552.
The product of its (nonzero) digits is 109734912, while the sum is 62.
The spelling of 80333748136673 in words is "eighty trillion, three hundred thirty-three billion, seven hundred forty-eight million, one hundred thirty-six thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •