Search a number
-
+
7509132013 is a prime number
BaseRepresentation
bin1101111111001010…
…00100001011101101
3201101022202102121111
412333211010023231
5110334314211023
63241042432021
7354040366105
oct67745041355
921338672544
107509132013
113203789029
121556962611
139289377a6
1451340c205
152de38800d
hex1bf9442ed

7509132013 has 2 divisors, whose sum is σ = 7509132014. Its totient is φ = 7509132012.

The previous prime is 7509131989. The next prime is 7509132019. The reversal of 7509132013 is 3102319057.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5929308004 + 1579824009 = 77002^2 + 39747^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×75091320132 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 27509132013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5670, while the sum is 31.

The square root of 7509132013 is about 86655.2480407275. The cubic root of 7509132013 is about 1958.2279566287.

The spelling of 7509132013 in words is "seven billion, five hundred nine million, one hundred thirty-two thousand, thirteen".