Base | Representation |
---|---|
bin | 101101001011010101… |
… | …000110001101001100 |
3 | 11122012122020012000000 |
4 | 231023111012031030 |
5 | 1243321131240100 |
6 | 34141240404300 |
7 | 3335041060113 |
oct | 551325061514 |
9 | 148178205000 |
10 | 48508461900 |
11 | 19632842438 |
12 | 9499476690 |
13 | 4760a511c2 |
14 | 24c25d0c7a |
15 | 13dd96c900 |
hex | b4b54634c |
48508461900 has 252 divisors, whose sum is σ = 159744249672. Its totient is φ = 12778145280.
The previous prime is 48508461839. The next prime is 48508461913. The reversal of 48508461900 is 916480584.
48508461900 is a `hidden beast` number, since 485 + 0 + 84 + 6 + 1 + 90 + 0 = 666.
It is a super-2 number, since 2×485084619002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
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 83 ways as a sum of consecutive naturals, for example, 6046692 + ... + 6054708.
Almost surely, 248508461900 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 48508461900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79872124836).
48508461900 is an abundant number, since it is smaller than the sum of its proper divisors (111235787772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48508461900 is a wasteful number, since it uses less digits than its factorization.
48508461900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8132 (or 8110 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 45.
The spelling of 48508461900 in words is "forty-eight billion, five hundred eight million, four hundred sixty-one thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.411 sec. • engine limits •