Search a number
-
+
5014014517709 is a prime number
BaseRepresentation
bin100100011110110101010…
…0011011110000111001101
3122202100001021220101112122
41020331222203132013031
51124122200204031314
614355223444142325
71025151645124301
oct110755243360715
918670037811478
105014014517709
1116634825310aa
1268b8bb3979a5
132a4a866b70b2
14134972b5bd01
158a65cc7128e
hex48f6a8de1cd

5014014517709 has 2 divisors, whose sum is σ = 5014014517710. Its totient is φ = 5014014517708.

The previous prime is 5014014517679. The next prime is 5014014517717. The reversal of 5014014517709 is 9077154104105.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5013524028100 + 490489609 = 2239090^2 + 22147^2 .

It is a cyclic number.

It is not a de Polignac number, because 5014014517709 - 28 = 5014014517453 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 5014014517709.

It is a congruent number.

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

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

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

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

Almost surely, 25014014517709 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 176400, while the sum is 44.

The spelling of 5014014517709 in words is "five trillion, fourteen billion, fourteen million, five hundred seventeen thousand, seven hundred nine".