Search a number
-
+
5605005157 is a prime number
BaseRepresentation
bin1010011100001010…
…11001011101100101
3112110121210202121121
411032011121131211
542434340131112
62324102413541
7255616520623
oct51605313545
915417722547
105605005157
112416974374
1211051312b1
136b42ba6cb
143b258c513
1522c112407
hex14e159765

5605005157 has 2 divisors, whose sum is σ = 5605005158. Its totient is φ = 5605005156.

The previous prime is 5605005143. The next prime is 5605005181. The reversal of 5605005157 is 7515005065.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4696223841 + 908781316 = 68529^2 + 30146^2 .

It is a cyclic number.

It is not a de Polignac number, because 5605005157 - 211 = 5605003109 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (5605005137) 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 as a sum of consecutive naturals, namely, 2802502578 + 2802502579.

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

Almost surely, 25605005157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 26250, while the sum is 34.

The square root of 5605005157 is about 74866.5823782547. The cubic root of 5605005157 is about 1776.3369053393.

The spelling of 5605005157 in words is "five billion, six hundred five million, five thousand, one hundred fifty-seven".