Search a number
-
+
5011004489 is a prime number
BaseRepresentation
bin1001010101010110…
…11101110001001001
3110221020002101212212
410222223131301021
540230304120424
62145123114505
7235114556351
oct45253356111
913836071785
105011004489
112141643927
12b7a212a35
1361b21271a
14357727b61
151e4dcc10e
hex12aaddc49

5011004489 has 2 divisors, whose sum is σ = 5011004490. Its totient is φ = 5011004488.

The previous prime is 5011004483. The next prime is 5011004491. The reversal of 5011004489 is 9844001105.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2544193600 + 2466810889 = 50440^2 + 49667^2 .

It is a cyclic number.

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

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

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

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

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

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

Almost surely, 25011004489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5760, while the sum is 32.

The square root of 5011004489 is about 70788.4488387759. The cubic root of 5011004489 is about 1711.2295215623.

The spelling of 5011004489 in words is "five billion, eleven million, four thousand, four hundred eighty-nine".