Base | Representation |
---|---|
bin | 1010000001101… |
… | …01001100111000 |
3 | 12212020220222200 |
4 | 11000311030320 |
5 | 133012311432 |
6 | 12202350200 |
7 | 2040605100 |
oct | 500651470 |
9 | 185226880 |
10 | 84103992 |
11 | 43524635 |
12 | 241bb360 |
13 | 1456939b |
14 | b254200 |
15 | 75b4a7c |
hex | 5035338 |
84103992 has 144 divisors (see below), whose sum is σ = 273873600. Its totient is φ = 23224320.
The previous prime is 84103991. The next prime is 84104011. The reversal of 84103992 is 29930148.
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 (84103991) by changing a digit.
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 35 ways as a sum of consecutive naturals, for example, 108984 + ... + 109752.
It is an arithmetic number, because the mean of its divisors is an integer number (1901900).
Almost surely, 284103992 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 84103992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136936800).
84103992 is an abundant number, since it is smaller than the sum of its proper divisors (189769608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
84103992 is a wasteful number, since it uses less digits than its factorization.
84103992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 826 (or 812 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 84103992 is about 9170.8228638438. The cubic root of 84103992 is about 438.1325676161.
The spelling of 84103992 in words is "eighty-four million, one hundred three thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •