Base | Representation |
---|---|
bin | 10010110010111110010100… |
… | …100100111001100100100001 |
3 | 101211200221212010012100210120 |
4 | 102302332110210321210201 |
5 | 41313412001412401243 |
6 | 451453010255150453 |
7 | 23261355241066614 |
oct | 2262762444714441 |
9 | 354627763170716 |
10 | 82667728247073 |
11 | 243822064a7a32 |
12 | 9331686b15429 |
13 | 37186c1936418 |
14 | 165b1d470617b |
15 | 98559d702c83 |
hex | 4b2f94939921 |
82667728247073 has 8 divisors (see below), whose sum is σ = 111776083263936. Its totient is φ = 54335596030800.
The previous prime is 82667728247063. The next prime is 82667728247113. The reversal of 82667728247073 is 37074282776628.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 82667728247073 - 24 = 82667728247057 is a prime.
It is a super-2 number, since 2×826677282470732 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 82667728246989 and 82667728247007.
It is not an unprimeable number, because it can be changed into a prime (82667728247063) 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, 194055699898 + ... + 194055700323.
It is an arithmetic number, because the mean of its divisors is an integer number (13972010407992).
Almost surely, 282667728247073 is an apocalyptic number.
It is an amenable number.
82667728247073 is a deficient number, since it is larger than the sum of its proper divisors (29108355016863).
82667728247073 is a wasteful number, since it uses less digits than its factorization.
82667728247073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 388111400295.
The product of its (nonzero) digits is 531062784, while the sum is 69.
The spelling of 82667728247073 in words is "eighty-two trillion, six hundred sixty-seven billion, seven hundred twenty-eight million, two hundred forty-seven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •