Search a number
-
+
5000811217 is a prime number
BaseRepresentation
bin1001010100001001…
…00101001011010001
3110220111220112100021
410222010211023101
540220201424332
62144120423441
7234632123353
oct45204451321
913814815307
105000811217
112136911536
12b76917b81
13619083bbc
143562330d3
151e4066c97
hex12a1252d1

5000811217 has 2 divisors, whose sum is σ = 5000811218. Its totient is φ = 5000811216.

The previous prime is 5000811209. The next prime is 5000811289. The reversal of 5000811217 is 7121180005.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3297515776 + 1703295441 = 57424^2 + 41271^2 .

It is a cyclic number.

It is not a de Polignac number, because 5000811217 - 23 = 5000811209 is a prime.

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

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

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

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

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

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

Almost surely, 25000811217 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 560, while the sum is 25.

The square root of 5000811217 is about 70716.4140564268. The cubic root of 5000811217 is about 1710.0684191130.

The spelling of 5000811217 in words is "five billion, eight hundred eleven thousand, two hundred seventeen".