Base | Representation |
---|---|
bin | 101101100010111100… |
… | …011101011101000001 |
3 | 11200020020201222002200 |
4 | 231202330131131001 |
5 | 1300124043003310 |
6 | 34244432303413 |
7 | 3350621503032 |
oct | 554274353501 |
9 | 150206658080 |
10 | 48904656705 |
11 | 19816449463 |
12 | 958a0a1b69 |
13 | 47c4b5c7b8 |
14 | 251d084a89 |
15 | 141362d9c0 |
hex | b62f1d741 |
48904656705 has 48 divisors (see below), whose sum is σ = 87110556624. Its totient is φ = 25365749760.
The previous prime is 48904656679. The next prime is 48904656709. The reversal of 48904656705 is 50765640984.
48904656705 is a `hidden beast` number, since 489 + 0 + 46 + 56 + 70 + 5 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 11220529329 + 37684127376 = 105927^2 + 194124^2 .
It is not a de Polignac number, because 48904656705 - 220 = 48903608129 is a prime.
It is not an unprimeable number, because it can be changed into a prime (48904656709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 543057 + ... + 626673.
It is an arithmetic number, because the mean of its divisors is an integer number (1814803263).
Almost surely, 248904656705 is an apocalyptic number.
48904656705 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
48904656705 is a deficient number, since it is larger than the sum of its proper divisors (38205899919).
48904656705 is a wasteful number, since it uses less digits than its factorization.
48904656705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83986 (or 83983 counting only the distinct ones).
The product of its (nonzero) digits is 7257600, while the sum is 54.
The spelling of 48904656705 in words is "forty-eight billion, nine hundred four million, six hundred fifty-six thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •