Base | Representation |
---|---|
bin | 100110100010000100… |
… | …1001011000101010000 |
3 | 21220120211021100021012 |
4 | 1031010021023011100 |
5 | 2323431343242000 |
6 | 102002544550052 |
7 | 5656364166233 |
oct | 1150411130520 |
9 | 256524240235 |
10 | 82747634000 |
11 | 32102978189 |
12 | 14054022328 |
13 | 7a59458a55 |
14 | 400da4b41a |
15 | 2244812735 |
hex | 134424b150 |
82747634000 has 40 divisors (see below), whose sum is σ = 200083783848. Its totient is φ = 33099052800.
The previous prime is 82747633987. The next prime is 82747634041. The reversal of 82747634000 is 43674728.
It can be written as a sum of positive squares in 4 ways, for example, as 12293487376 + 70454146624 = 110876^2 + 265432^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a hoax number, since the sum of its digits (41) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20684909 + ... + 20688908.
Almost surely, 282747634000 is an apocalyptic number.
82747634000 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
82747634000 is an abundant number, since it is smaller than the sum of its proper divisors (117336149848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
82747634000 is a wasteful number, since it uses less digits than its factorization.
82747634000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41373840 (or 41373824 counting only the distinct ones).
The product of its (nonzero) digits is 225792, while the sum is 41.
The spelling of 82747634000 in words is "eighty-two billion, seven hundred forty-seven million, six hundred thirty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •