Base | Representation |
---|---|
bin | 100111001111010101… |
… | …0011011001001110000 |
3 | 22001111122220120101200 |
4 | 1032132222123021300 |
5 | 2340034133100031 |
6 | 102413355131200 |
7 | 6042124506033 |
oct | 1163652331160 |
9 | 261448816350 |
10 | 84266300016 |
11 | 32812147468 |
12 | 143b8743b00 |
13 | 7c3bc851b2 |
14 | 411560d01a |
15 | 22d2ce78e6 |
hex | 139ea9b270 |
84266300016 has 240 divisors, whose sum is σ = 246715155648. Its totient is φ = 26824089600.
The previous prime is 84266300011. The next prime is 84266300059. The reversal of 84266300016 is 61000366248.
84266300016 is a `hidden beast` number, since 8 + 4 + 2 + 6 + 630 + 0 + 0 + 16 = 666.
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 (84266300011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 127482726 + ... + 127483386.
Almost surely, 284266300016 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 84266300016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123357577824).
84266300016 is an abundant number, since it is smaller than the sum of its proper divisors (162448855632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
84266300016 is a wasteful number, since it uses less digits than its factorization.
84266300016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1120 (or 1111 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 36.
The spelling of 84266300016 in words is "eighty-four billion, two hundred sixty-six million, three hundred thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •