Base | Representation |
---|---|
bin | 10010101101111010101101… |
… | …001001100011001011010101 |
3 | 101210110201221122002211211122 |
4 | 102231322231021203023111 |
5 | 41242213332012010020 |
6 | 451025222215013325 |
7 | 23224304330052314 |
oct | 2255725511431325 |
9 | 353421848084748 |
10 | 82320248156885 |
11 | 24258904000182 |
12 | 929627066a245 |
13 | 36c19c61485bb |
14 | 164846d7c827b |
15 | 97b512a0e125 |
hex | 4adead2632d5 |
82320248156885 has 8 divisors (see below), whose sum is σ = 98786316023640. Its totient is φ = 65854853035264.
The previous prime is 82320248156869. The next prime is 82320248156911. The reversal of 82320248156885 is 58865184202328.
It can be written as a sum of positive squares in 4 ways, for example, as 10075025077924 + 72245223078961 = 3174118^2 + 8499719^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 82320248156885 - 24 = 82320248156869 is a prime.
It is a super-2 number, since 2×823202481568852 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167917040 + ... + 168406569.
It is an arithmetic number, because the mean of its divisors is an integer number (12348289502955).
Almost surely, 282320248156885 is an apocalyptic number.
It is an amenable number.
82320248156885 is a deficient number, since it is larger than the sum of its proper divisors (16466067866755).
82320248156885 is a wasteful number, since it uses less digits than its factorization.
82320248156885 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336372567.
The product of its (nonzero) digits is 58982400, while the sum is 62.
The spelling of 82320248156885 in words is "eighty-two trillion, three hundred twenty billion, two hundred forty-eight million, one hundred fifty-six thousand, eight hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •