Base | Representation |
---|---|
bin | 1010000001101… |
… | …11001010101111 |
3 | 12212021100001000 |
4 | 11000313022233 |
5 | 133013041142 |
6 | 12202451343 |
7 | 2040640425 |
oct | 500671257 |
9 | 185240030 |
10 | 84112047 |
11 | 4352a698 |
12 | 24203b53 |
13 | 1456cc56 |
14 | b257115 |
15 | 75b714c |
hex | 50372af |
84112047 has 8 divisors (see below), whose sum is σ = 124610480. Its totient is φ = 56074680.
The previous prime is 84112043. The next prime is 84112051. The reversal of 84112047 is 74021148.
It is an interprime number because it is at equal distance from previous prime (84112043) and next prime (84112051).
It is not a de Polignac number, because 84112047 - 22 = 84112043 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 3115261 = 84112047 / (8 + 4 + 1 + 1 + 2 + 0 + 4 + 7).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 84112047.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (84112043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1557604 + ... + 1557657.
It is an arithmetic number, because the mean of its divisors is an integer number (15576310).
Almost surely, 284112047 is an apocalyptic number.
84112047 is a deficient number, since it is larger than the sum of its proper divisors (40498433).
84112047 is a wasteful number, since it uses less digits than its factorization.
84112047 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3115270 (or 3115264 counting only the distinct ones).
The product of its (nonzero) digits is 1792, while the sum is 27.
The square root of 84112047 is about 9171.2620178468. The cubic root of 84112047 is about 438.1465544479.
The spelling of 84112047 in words is "eighty-four million, one hundred twelve thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •