Search a number
-
+
5026110181 is a prime number
BaseRepresentation
bin1001010111001010…
…00101101011100101
3110222021111211222221
410223211011223211
540243141011211
62150422552341
7235360142311
oct45345055345
913867454887
105026110181
11214a120a74
12b832986b1
136213a11c1
1435973ab41
151e63b2c71
hex12b945ae5

5026110181 has 2 divisors, whose sum is σ = 5026110182. Its totient is φ = 5026110180.

The previous prime is 5026110139. The next prime is 5026110211. The reversal of 5026110181 is 1810116205.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4696360900 + 329749281 = 68530^2 + 18159^2 .

It is a cyclic number.

It is not a de Polignac number, because 5026110181 - 219 = 5025585893 is a prime.

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

It is a congruent number.

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

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

Almost surely, 25026110181 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 5026110181 is about 70895.0645743411. The cubic root of 5026110181 is about 1712.9472992578.

Adding to 5026110181 its reverse (1810116205), we get a palindrome (6836226386).

The spelling of 5026110181 in words is "five billion, twenty-six million, one hundred ten thousand, one hundred eighty-one".