Search a number
-
+
5371125569 is a prime number
BaseRepresentation
bin1010000000010010…
…01101111101000001
3111212022201110010122
411000021031331001
542000002004234
62244545510025
7250046546135
oct50011157501
914768643118
105371125569
112306951157
12105a942315
13677a00614
1438d4ab3c5
1521681492e
hex14024df41

5371125569 has 2 divisors, whose sum is σ = 5371125570. Its totient is φ = 5371125568.

The previous prime is 5371125547. The next prime is 5371125589. The reversal of 5371125569 is 9655211735.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3792096400 + 1579029169 = 61580^2 + 39737^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-5371125569 is a prime.

It is a super-2 number, since 2×53711255692 = 57697979755931147522, which contains 22 as substring.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 25371125569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 283500, while the sum is 44.

The square root of 5371125569 is about 73287.9633295946. The cubic root of 5371125569 is about 1751.2780399060.

The spelling of 5371125569 in words is "five billion, three hundred seventy-one million, one hundred twenty-five thousand, five hundred sixty-nine".