Base | Representation |
---|---|
bin | 101101001011101111… |
… | …011011111011001001 |
3 | 11122020010012222110200 |
4 | 231023233123323021 |
5 | 1243324413212401 |
6 | 34142044402413 |
7 | 3335153545332 |
oct | 551357337311 |
9 | 148203188420 |
10 | 48515366601 |
11 | 19636728aa9 |
12 | 949b846409 |
13 | 47622cac20 |
14 | 24c34ab289 |
15 | 13de383686 |
hex | b4bbdbec9 |
48515366601 has 12 divisors (see below), whose sum is σ = 75468348228. Its totient is φ = 29855610144.
The previous prime is 48515366597. The next prime is 48515366659. The reversal of 48515366601 is 10666351584.
It can be written as a sum of positive squares in 2 ways, for example, as 9331560000 + 39183806601 = 96600^2 + 197949^2 .
It is not a de Polignac number, because 48515366601 - 22 = 48515366597 is a prime.
It is not an unprimeable number, because it can be changed into a prime (48515362601) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 207330510 + ... + 207330743.
It is an arithmetic number, because the mean of its divisors is an integer number (6289029019).
Almost surely, 248515366601 is an apocalyptic number.
It is an amenable number.
48515366601 is a deficient number, since it is larger than the sum of its proper divisors (26952981627).
48515366601 is a wasteful number, since it uses less digits than its factorization.
48515366601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 414661272 (or 414661269 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 45.
The spelling of 48515366601 in words is "forty-eight billion, five hundred fifteen million, three hundred sixty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •