Search a number
-
+
53015976751 = 199926521249
BaseRepresentation
bin110001010111111111…
…111001101100101111
312001211202220122221111
4301113333321230233
51332034042224001
640204420212451
73554533236613
oct612777715457
9161752818844
1053015976751
1120536156021
12a336b3a127
134ccb85935a
1427cd0d5343
1515a4542851
hexc57ff9b2f

53015976751 has 4 divisors (see below), whose sum is σ = 53042500000. Its totient is φ = 52989453504.

The previous prime is 53015976737. The next prime is 53015976779. The reversal of 53015976751 is 15767951035.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 53015976751 - 25 = 53015976719 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (53015976721) 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, 13258626 + ... + 13262623.

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

Almost surely, 253015976751 is an apocalyptic number.

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

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

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

The sum of its prime factors is 26523248.

The product of its (nonzero) digits is 992250, while the sum is 49.

The spelling of 53015976751 in words is "fifty-three billion, fifteen million, nine hundred seventy-six thousand, seven hundred fifty-one".

Divisors: 1 1999 26521249 53015976751