Base | Representation |
---|---|
bin | 101101001100101001… |
… | …010110111000010000 |
3 | 11122021011210101120110 |
4 | 231030221112320100 |
5 | 1243342310102123 |
6 | 34143350041320 |
7 | 3335426604543 |
oct | 551451267020 |
9 | 148234711513 |
10 | 48530550288 |
11 | 19644259800 |
12 | 94a4949240 |
13 | 47654b605c |
14 | 24c550085a |
15 | 13e0882493 |
hex | b4ca56e10 |
48530550288 has 180 divisors, whose sum is σ = 139156395504. Its totient is φ = 14562979200.
The previous prime is 48530550283. The next prime is 48530550317. The reversal of 48530550288 is 88205503584.
It is a super-2 number, since 2×485305502882 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (48530550283) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 230002503 + ... + 230002713.
Almost surely, 248530550288 is an apocalyptic number.
48530550288 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48530550288, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69578197752).
48530550288 is an abundant number, since it is smaller than the sum of its proper divisors (90625845216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48530550288 is a wasteful number, since it uses less digits than its factorization.
48530550288 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 642 (or 426 counting only the distinct ones).
The product of its (nonzero) digits is 1536000, while the sum is 48.
The spelling of 48530550288 in words is "forty-eight billion, five hundred thirty million, five hundred fifty thousand, two hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •