Base | Representation |
---|---|
bin | 1010000001010… |
… | …11010111011100 |
3 | 12212011212201200 |
4 | 11000223113130 |
5 | 133010014313 |
6 | 12201435500 |
7 | 2040346461 |
oct | 500532734 |
9 | 185155650 |
10 | 84063708 |
11 | 434a7343 |
12 | 2419bb90 |
13 | 14553c51 |
14 | b243668 |
15 | 75a7b73 |
hex | 502b5dc |
84063708 has 36 divisors (see below), whose sum is σ = 224995680. Its totient is φ = 26372736.
The previous prime is 84063703. The next prime is 84063719. The reversal of 84063708 is 80736048.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-4 number, since 4×840637084 (a number of 33 digits) contains 4444 as substring. Note that it is a super-d number also for d = 3.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (84063701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 68068 + ... + 69291.
It is an arithmetic number, because the mean of its divisors is an integer number (6249880).
Almost surely, 284063708 is an apocalyptic number.
It is an amenable number.
84063708 is an abundant number, since it is smaller than the sum of its proper divisors (140931972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
84063708 is a wasteful number, since it uses less digits than its factorization.
84063708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137386 (or 137381 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 84063708 is about 9168.6262875089. The cubic root of 84063708 is about 438.0626044247.
The spelling of 84063708 in words is "eighty-four million, sixty-three thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •