Search a number
-
+
48515336413 = 107453414359
BaseRepresentation
bin101101001011101111…
…010100100011011101
311122020010011110001121
4231023233110203131
51243324411231123
634142044010541
73335153361325
oct551357244335
9148203143047
1048515336413
1119636708355
12949b830a51
1347622ba26b
1424c34a0285
1513de37975d
hexb4bbd48dd

48515336413 has 4 divisors (see below), whose sum is σ = 48968750880. Its totient is φ = 48061921948.

The previous prime is 48515336393. The next prime is 48515336437. The reversal of 48515336413 is 31463351584.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 48515336413 - 29 = 48515335901 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 48515336413.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (48515336453) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 226707073 + ... + 226707286.

It is an arithmetic number, because the mean of its divisors is an integer number (12242187720).

Almost surely, 248515336413 is an apocalyptic number.

It is an amenable number.

48515336413 is a deficient number, since it is larger than the sum of its proper divisors (453414467).

48515336413 is a wasteful number, since it uses less digits than its factorization.

48515336413 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 453414466.

The product of its digits is 518400, while the sum is 43.

Adding to 48515336413 its reverse (31463351584), we get a palindrome (79978687997).

The spelling of 48515336413 in words is "forty-eight billion, five hundred fifteen million, three hundred thirty-six thousand, four hundred thirteen".

Divisors: 1 107 453414359 48515336413