Base | Representation |
---|---|
bin | 1111001001001111… |
… | …00110110010101000 |
3 | 202222122001222202110 |
4 | 13210213212302220 |
5 | 113122410230143 |
6 | 3422442002320 |
7 | 405324402060 |
oct | 74447466250 |
9 | 22878058673 |
10 | 8130555048 |
11 | 34a2539390 |
12 | 16aaaa63a0 |
13 | 9c75c4425 |
14 | 571b703a0 |
15 | 328bd8533 |
hex | 1e49e6ca8 |
8130555048 has 128 divisors (see below), whose sum is σ = 26832798720. Its totient is φ = 1987599360.
The previous prime is 8130555023. The next prime is 8130555077. The reversal of 8130555048 is 8405550318.
It is a super-2 number, since 2×81305550482 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 8130554997 and 8130555015.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 97986 + ... + 160817.
It is an arithmetic number, because the mean of its divisors is an integer number (209631240).
Almost surely, 28130555048 is an apocalyptic number.
8130555048 is a gapful number since it is divisible by the number (88) formed by its first and last digit.
It is an amenable number.
8130555048 is an abundant number, since it is smaller than the sum of its proper divisors (18702243672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8130555048 is a wasteful number, since it uses less digits than its factorization.
8130555048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258847 (or 258843 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 39.
The square root of 8130555048 is about 90169.5904837102. The cubic root of 8130555048 is about 2010.8209354239.
The spelling of 8130555048 in words is "eight billion, one hundred thirty million, five hundred fifty-five thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •