Base | Representation |
---|---|
bin | 1010000101111… |
… | …00001001100100 |
3 | 12220022000012211 |
4 | 11002330021210 |
5 | 133133003430 |
6 | 12222253204 |
7 | 2045366440 |
oct | 502741144 |
9 | 186260184 |
10 | 84656740 |
11 | 43871953 |
12 | 24427204 |
13 | 14700b5c |
14 | b359820 |
15 | 767372a |
hex | 50bc264 |
84656740 has 96 divisors (see below), whose sum is σ = 212970240. Its totient is φ = 27661824.
The previous prime is 84656731. The next prime is 84656743. The reversal of 84656740 is 4765648.
It is a junction number, because it is equal to n+sod(n) for n = 84656693 and 84656702.
It is not an unprimeable number, because it can be changed into a prime (84656743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 305482 + ... + 305758.
It is an arithmetic number, because the mean of its divisors is an integer number (2218440).
Almost surely, 284656740 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 84656740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106485120).
84656740 is an abundant number, since it is smaller than the sum of its proper divisors (128313500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
84656740 is a wasteful number, since it uses less digits than its factorization.
84656740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389 (or 387 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 40.
The square root of 84656740 is about 9200.9097376292. The cubic root of 84656740 is about 439.0903037023.
The spelling of 84656740 in words is "eighty-four million, six hundred fifty-six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •