Base | Representation |
---|---|
bin | 10011000110010111110110… |
… | …000101100000110010110000 |
3 | 102000102101202110111121010110 |
4 | 103012113312011200302300 |
5 | 42002232121314014143 |
6 | 454353234152101320 |
7 | 23456600142330036 |
oct | 2306276605406260 |
9 | 360371673447113 |
10 | 84000804048048 |
11 | 248465a4a96a28 |
12 | 9507b03394840 |
13 | 37b431b3ca214 |
14 | 16a59369d4556 |
15 | 9aa0c12ba533 |
hex | 4c65f6160cb0 |
84000804048048 has 20 divisors (see below), whose sum is σ = 217002077124248. Its totient is φ = 28000268016000.
The previous prime is 84000804047987. The next prime is 84000804048079. The reversal of 84000804048048 is 84084040800048.
It is a happy number.
It is a super-2 number, since 2×840008040480482 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 1750016751001 = 84000804048048 / (8 + 4 + 0 + 0 + 0 + 8 + 0 + 4 + 0 + 4 + 8 + 0 + 4 + 8).
It is a junction number, because it is equal to n+sod(n) for n = 84000804047988 and 84000804048006.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 875008375453 + ... + 875008375548.
Almost surely, 284000804048048 is an apocalyptic number.
It is an amenable number.
84000804048048 is an abundant number, since it is smaller than the sum of its proper divisors (133001273076200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
84000804048048 is a wasteful number, since it uses less digits than its factorization.
84000804048048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1750016751012 (or 1750016751006 counting only the distinct ones).
The product of its (nonzero) digits is 1048576, while the sum is 48.
The spelling of 84000804048048 in words is "eighty-four trillion, eight hundred four million, forty-eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •