Search a number
-
+
5324463239 is a prime number
BaseRepresentation
bin1001111010101110…
…01101110010000111
3111202001220202110012
410331113031302013
541401030310424
62240201420435
7245642122304
oct47527156207
914661822405
105324463239
112292580047
12104719a71b
1366b143484
143872020ab
15212698b0e
hex13d5cdc87

5324463239 has 2 divisors, whose sum is σ = 5324463240. Its totient is φ = 5324463238.

The previous prime is 5324463229. The next prime is 5324463259. The reversal of 5324463239 is 9323644235.

5324463239 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

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

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

It is a junction number, because it is equal to n+sod(n) for n = 5324463196 and 5324463205.

It is a congruent number.

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

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

Almost surely, 25324463239 is an apocalyptic number.

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

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

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

The product of its digits is 466560, while the sum is 41.

The square root of 5324463239 is about 72968.9196781753. The cubic root of 5324463239 is about 1746.1917993654.

The spelling of 5324463239 in words is "five billion, three hundred twenty-four million, four hundred sixty-three thousand, two hundred thirty-nine".