Base | Representation |
---|---|
bin | 1010000011011… |
… | …11100011111000 |
3 | 12212201001220000 |
4 | 11001233203320 |
5 | 133042434112 |
6 | 12211433000 |
7 | 2042622024 |
oct | 501574370 |
9 | 185631800 |
10 | 84343032 |
11 | 43678194 |
12 | 242b5760 |
13 | 14621127 |
14 | b2b7384 |
15 | 76107dc |
hex | 506f8f8 |
84343032 has 80 divisors (see below), whose sum is σ = 239609040. Its totient is φ = 27713664.
The previous prime is 84343003. The next prime is 84343073. The reversal of 84343032 is 23034348.
It is a super-2 number, since 2×843430322 = 14227494093906048, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 84342987 and 84343005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 46413 + ... + 48195.
It is an arithmetic number, because the mean of its divisors is an integer number (2995113).
Almost surely, 284343032 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 84343032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119804520).
84343032 is an abundant number, since it is smaller than the sum of its proper divisors (155266008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
84343032 is a wasteful number, since it uses less digits than its factorization.
84343032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1874 (or 1861 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
The square root of 84343032 is about 9183.8462530685. The cubic root of 84343032 is about 438.5472611427.
The spelling of 84343032 in words is "eighty-four million, three hundred forty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •