Search a number
-
+
5631357071 is a prime number
BaseRepresentation
bin1010011111010011…
…11011000010001111
3112112110101120122102
411033221323002033
543013111411241
62330443305315
7256356513434
oct51751730217
915473346572
105631357071
11242a832a0a
121111b1b23b
136b98b6062
143b5c8bb8b
1522e5ba39b
hex14fa7b08f

5631357071 has 2 divisors, whose sum is σ = 5631357072. Its totient is φ = 5631357070.

The previous prime is 5631357037. The next prime is 5631357073. The reversal of 5631357071 is 1707531365.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 5631357071 - 210 = 5631356047 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 25631357071 is an apocalyptic number.

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

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

5631357071 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 5631357071 is about 75042.3685060646. The cubic root of 5631357071 is about 1779.1163681132.

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