Base | Representation |
---|---|
bin | 1010000100111… |
… | …11110100000000 |
3 | 12220002010000000 |
4 | 11002133310000 |
5 | 133120300142 |
6 | 12220000000 |
7 | 2044404156 |
oct | 502376400 |
9 | 186063000 |
10 | 84540672 |
11 | 437a2727 |
12 | 24390000 |
13 | 14690088 |
14 | b3293d6 |
15 | 764e14c |
hex | 509fd00 |
84540672 has 144 divisors (see below), whose sum is σ = 254764160. Its totient is φ = 27993600.
The previous prime is 84540637. The next prime is 84540697. The reversal of 84540672 is 27604548.
It is a tau number, because it is divible by the number of its divisors (144).
It is a super-3 number, since 3×845406723 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 559797 + ... + 559947.
Almost surely, 284540672 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 84540672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127382080).
84540672 is an abundant number, since it is smaller than the sum of its proper divisors (170223488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
84540672 is an frugal number, since it uses more digits than its factorization.
84540672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188 (or 156 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 36.
The square root of 84540672 is about 9194.6001544385. The cubic root of 84540672 is about 438.8895414139.
The spelling of 84540672 in words is "eighty-four million, five hundred forty thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •