Search a number
-
+
5011501010561 is a prime number
BaseRepresentation
bin100100011101101010010…
…1111001100111010000001
3122202002120010021222221022
41020323110233030322001
51124102023224314221
614354130215035225
71025032444511153
oct110732457147201
918662503258838
105011501010561
111662402741a71
1268b31966bb15
132a4775a38966
141347b4dd2ad3
158a5622784ab
hex48ed4bcce81

5011501010561 has 2 divisors, whose sum is σ = 5011501010562. Its totient is φ = 5011501010560.

The previous prime is 5011501010543. The next prime is 5011501010563. The reversal of 5011501010561 is 1650101051105.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4952267186161 + 59233824400 = 2225369^2 + 243380^2 .

It is a cyclic number.

It is not a de Polignac number, because 5011501010561 - 26 = 5011501010497 is a prime.

Together with 5011501010563, it forms a pair of twin primes.

It is a Chen prime.

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

It is not a weakly prime, because it can be changed into another prime (5011501010563) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2505750505280 + 2505750505281.

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

Almost surely, 25011501010561 is an apocalyptic number.

It is an amenable number.

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

5011501010561 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 750, while the sum is 26.

Adding to 5011501010561 its reverse (1650101051105), we get a palindrome (6661602061666).

The spelling of 5011501010561 in words is "five trillion, eleven billion, five hundred one million, ten thousand, five hundred sixty-one".