Base | Representation |
---|---|
bin | 100110010110110001… |
… | …0100011101111111001 |
3 | 21212121101200220101120 |
4 | 1030231202203233321 |
5 | 2322142303201130 |
6 | 101501200535453 |
7 | 5644110645540 |
oct | 1145542435771 |
9 | 255541626346 |
10 | 82368412665 |
11 | 31a28904620 |
12 | 13b69021589 |
13 | 79c8a11126 |
14 | 3db5535157 |
15 | 22213a5910 |
hex | 132d8a3bf9 |
82368412665 has 128 divisors (see below), whose sum is σ = 176179691520. Its totient is φ = 31809024000.
The previous prime is 82368412663. The next prime is 82368412691. The reversal of 82368412665 is 56621486328.
It is not a de Polignac number, because 82368412665 - 21 = 82368412663 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (82368412663) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1524615 + ... + 1577715.
It is an arithmetic number, because the mean of its divisors is an integer number (1376403840).
Almost surely, 282368412665 is an apocalyptic number.
82368412665 is a gapful number since it is divisible by the number (85) formed by its first and last digit.
It is an amenable number.
82368412665 is an abundant number, since it is smaller than the sum of its proper divisors (93811278855).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
82368412665 is a wasteful number, since it uses less digits than its factorization.
82368412665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53223.
The product of its digits is 3317760, while the sum is 51.
The spelling of 82368412665 in words is "eighty-two billion, three hundred sixty-eight million, four hundred twelve thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •