Search a number
-
+
500110213 is a prime number
BaseRepresentation
bin11101110011110…
…001001110000101
31021212001020020111
4131303301032011
52011012011323
6121343033021
715251603161
oct3563611605
91255036214
10500110213
11237332229
1211b59b771
137c7c3305
144a5c3ca1
152dd8ac0d
hex1dcf1385

500110213 has 2 divisors, whose sum is σ = 500110214. Its totient is φ = 500110212.

The previous prime is 500110157. The next prime is 500110223. The reversal of 500110213 is 312011005.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 311240164 + 188870049 = 17642^2 + 13743^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-500110213 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2500110213 is an apocalyptic number.

It is an amenable number.

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

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

500110213 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 30, while the sum is 13.

The square root of 500110213 is about 22363.1440768064. The cubic root of 500110213 is about 793.7588391104.

Adding to 500110213 its reverse (312011005), we get a palindrome (812121218).

The spelling of 500110213 in words is "five hundred million, one hundred ten thousand, two hundred thirteen".