Base | Representation |
---|---|
bin | 1010000110100… |
… | …10000001100100 |
3 | 12220110120010100 |
4 | 11003102001210 |
5 | 133143340330 |
6 | 12224224100 |
7 | 2046221610 |
oct | 503220144 |
9 | 186416110 |
10 | 84746340 |
11 | 439231a8 |
12 | 2446b030 |
13 | 14732883 |
14 | b380340 |
15 | 7690060 |
hex | 50d2064 |
84746340 has 144 divisors (see below), whose sum is σ = 297093888. Its totient is φ = 19153152.
The previous prime is 84746273. The next prime is 84746341. The reversal of 84746340 is 4364748.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 84746295 and 84746304.
It is not an unprimeable number, because it can be changed into a prime (84746341) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 129454 + ... + 130106.
It is an arithmetic number, because the mean of its divisors is an integer number (2063152).
Almost surely, 284746340 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 84746340, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148546944).
84746340 is an abundant number, since it is smaller than the sum of its proper divisors (212347548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
84746340 is a wasteful number, since it uses less digits than its factorization.
84746340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778 (or 773 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 36.
The square root of 84746340 is about 9205.7775337013. Note that the first 3 decimals coincide. The cubic root of 84746340 is about 439.2451589426.
The spelling of 84746340 in words is "eighty-four million, seven hundred forty-six thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •