Base | Representation |
---|---|
bin | 1010000110010… |
… | …00001101110100 |
3 | 12220101112000100 |
4 | 11003020031310 |
5 | 133141044124 |
6 | 12223314100 |
7 | 2045663514 |
oct | 503101564 |
9 | 186345010 |
10 | 84706164 |
11 | 438a5aa4 |
12 | 2444b930 |
13 | 1471a4ba |
14 | b36d844 |
15 | 76831c9 |
hex | 50c8374 |
84706164 has 36 divisors (see below), whose sum is σ = 219344580. Its totient is φ = 27546240.
The previous prime is 84706159. The next prime is 84706261. The reversal of 84706164 is 46160748.
It can be written as a sum of positive squares in 2 ways, for example, as 28005264 + 56700900 = 5292^2 + 7530^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-3 number, since 3×847061643 (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 11 ways as a sum of consecutive naturals, for example, 27219 + ... + 30170.
It is an arithmetic number, because the mean of its divisors is an integer number (6092905).
Almost surely, 284706164 is an apocalyptic number.
It is an amenable number.
84706164 is an abundant number, since it is smaller than the sum of its proper divisors (134638416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
84706164 is a wasteful number, since it uses less digits than its factorization.
84706164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57440 (or 57435 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 84706164 is about 9203.5951671073. The cubic root of 84706164 is about 439.1757364640.
The spelling of 84706164 in words is "eighty-four million, seven hundred six thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •