Search a number
-
+
5001105017 is a prime number
BaseRepresentation
bin1001010100001011…
…01100111001111001
3110220112110110100202
410222011230321321
540220240330032
62144131011545
7234634456046
oct45205547171
913815413322
105001105017
112136aa2247
12b76a39bb5
1361915784c
143562ac1cd
151e40c3d62
hex12a16ce79

5001105017 has 2 divisors, whose sum is σ = 5001105018. Its totient is φ = 5001105016.

The previous prime is 5001104989. The next prime is 5001105023. The reversal of 5001105017 is 7105011005.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2948924416 + 2052180601 = 54304^2 + 45301^2 .

It is a cyclic number.

It is not a de Polignac number, because 5001105017 - 214 = 5001088633 is a prime.

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

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

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

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

Almost surely, 25001105017 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 175, while the sum is 20.

The square root of 5001105017 is about 70718.4913371319. The cubic root of 5001105017 is about 1710.1019075639.

The spelling of 5001105017 in words is "five billion, one million, one hundred five thousand, seventeen".