Base | Representation |
---|---|
bin | 101101010001101111… |
… | …010011000011010000 |
3 | 11122111010120100200210 |
4 | 231101233103003100 |
5 | 1244031143243202 |
6 | 34200041244120 |
7 | 3340515061350 |
oct | 552157230320 |
9 | 148433510623 |
10 | 48615993552 |
11 | 19688508575 |
12 | 9509493640 |
13 | 477a100bb9 |
14 | 24d29c2b60 |
15 | 13e810dc6c |
hex | b51bd30d0 |
48615993552 has 40 divisors (see below), whose sum is σ = 143532934336. Its totient is φ = 13890283776.
The previous prime is 48615993523. The next prime is 48615993553. The reversal of 48615993552 is 25539951684.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 48615993492 and 48615993501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48615993553) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 72344893 + ... + 72345564.
Almost surely, 248615993552 is an apocalyptic number.
48615993552 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
48615993552 is an abundant number, since it is smaller than the sum of its proper divisors (94916940784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48615993552 is a wasteful number, since it uses less digits than its factorization.
48615993552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144690475 (or 144690469 counting only the distinct ones).
The product of its digits is 11664000, while the sum is 57.
The spelling of 48615993552 in words is "forty-eight billion, six hundred fifteen million, nine hundred ninety-three thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •