Base | Representation |
---|---|
bin | 101101001110100101… |
… | …100110111011111011 |
3 | 11122100110002012110000 |
4 | 231032211212323323 |
5 | 1243424124400130 |
6 | 34150512124043 |
7 | 3336303503550 |
oct | 551645467373 |
9 | 148313065400 |
10 | 48563121915 |
11 | 19660686300 |
12 | 94b3836623 |
13 | 476c17b6c9 |
14 | 24c997ca27 |
15 | 13e3668260 |
hex | b4e966efb |
48563121915 has 240 divisors, whose sum is σ = 115128034560. Its totient is φ = 19117296000.
The previous prime is 48563121847. The next prime is 48563121923. The reversal of 48563121915 is 51912136584.
It is a happy number.
48563121915 is a `hidden beast` number, since 4 + 8 + 5 + 631 + 2 + 1 + 9 + 1 + 5 = 666.
It is not a de Polignac number, because 48563121915 - 218 = 48562859771 is a prime.
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 (23) of ones.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 6513940 + ... + 6521390.
It is an arithmetic number, because the mean of its divisors is an integer number (479700144).
Almost surely, 248563121915 is an apocalyptic number.
48563121915 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
48563121915 is an abundant number, since it is smaller than the sum of its proper divisors (66564912645).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48563121915 is a wasteful number, since it uses less digits than its factorization.
48563121915 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7516 (or 7496 counting only the distinct ones).
The product of its digits is 259200, while the sum is 45.
The spelling of 48563121915 in words is "forty-eight billion, five hundred sixty-three million, one hundred twenty-one thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •