Search a number
-
+
48515366601 = 3213414661253
BaseRepresentation
bin101101001011101111…
…011011111011001001
311122020010012222110200
4231023233123323021
51243324413212401
634142044402413
73335153545332
oct551357337311
9148203188420
1048515366601
1119636728aa9
12949b846409
1347622cac20
1424c34ab289
1513de383686
hexb4bbdbec9

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".

Divisors: 1 3 9 13 39 117 414661253 1243983759 3731951277 5390596289 16171788867 48515366601