Search a number
-
+
5110501111 is a prime number
BaseRepresentation
bin1001100001001110…
…00000111011110111
3111012011022100120221
410300213000323313
540431242013421
62203035435211
7240433354102
oct46047007367
914164270527
105110501111
112192821141
12ba75b5b07
13635a0b071
14366a27739
151ed9d2841
hex1309c0ef7

5110501111 has 2 divisors, whose sum is σ = 5110501112. Its totient is φ = 5110501110.

The previous prime is 5110501093. The next prime is 5110501147. The reversal of 5110501111 is 1111050115.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 5110501111 - 211 = 5110499063 is a prime.

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

It is a congruent number.

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

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

Almost surely, 25110501111 is an apocalyptic number.

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

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

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

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

The square root of 5110501111 is about 71487.7689608509. The cubic root of 5110501111 is about 1722.4812205263.

Adding to 5110501111 its reverse (1111050115), we get a palindrome (6221551226).

The spelling of 5110501111 in words is "five billion, one hundred ten million, five hundred one thousand, one hundred eleven".