Search a number
-
+
5150372569 is a prime number
BaseRepresentation
bin1001100101111110…
…00111001011011001
3111021221100000221121
410302333013023121
541021443410234
62211022205241
7241426305316
oct46277071331
914257300847
105150372569
112203284161
12bb8a23821
1364105b244
1436c045d0d
1520225b4b4
hex132fc72d9

5150372569 has 2 divisors, whose sum is σ = 5150372570. Its totient is φ = 5150372568.

The previous prime is 5150372567. The next prime is 5150372593. The reversal of 5150372569 is 9652730515.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3135440025 + 2014932544 = 55995^2 + 44888^2 .

It is a cyclic number.

It is not a de Polignac number, because 5150372569 - 21 = 5150372567 is a prime.

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

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

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

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

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

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

Almost surely, 25150372569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 283500, while the sum is 43.

The square root of 5150372569 is about 71766.0962363148. The cubic root of 5150372569 is about 1726.9491452389.

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