Search a number
-
+
5307671531 is a prime number
BaseRepresentation
bin1001111000101110…
…01010001111101011
3111200220022122120002
410330113022033223
541332230442111
62234401453215
7245346315011
oct47427121753
914626278502
105307671531
1122840511a8
12104164120b
13667814456
14384cb08b1
15210e7d63b
hex13c5ca3eb

5307671531 has 2 divisors, whose sum is σ = 5307671532. Its totient is φ = 5307671530.

The previous prime is 5307671491. The next prime is 5307671533. The reversal of 5307671531 is 1351767035.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 5307671531 - 210 = 5307670507 is a prime.

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

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

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (5307671533) 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, 2653835765 + 2653835766.

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

Almost surely, 25307671531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 66150, while the sum is 38.

The square root of 5307671531 is about 72853.7681317857. The cubic root of 5307671531 is about 1744.3542169152.

The spelling of 5307671531 in words is "five billion, three hundred seven million, six hundred seventy-one thousand, five hundred thirty-one".