48927695565 has 32 divisors (see below), whose sum is σ = 90693386496. Its totient is φ = 22060546560.

The previous prime is 48927695501. The next prime is 48927695567. The reversal of 48927695565 is 56559672984.

It is not a de Polignac number, because 48927695565 - 2⁶ = 48927695501 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 48927695496 and 48927695505.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (48927695567) 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 31 ways as a sum of consecutive naturals, for example, 3183966 + ... + 3199295.

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

Almost surely, 2^48927695565 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6383349.

The product of its digits is 163296000, while the sum is 66.

The spelling of 48927695565 in words is "forty-eight billion, nine hundred twenty-seven million, six hundred ninety-five thousand, five hundred sixty-five".