Search a number
-
+
10150213 is a prime number
BaseRepresentation
bin100110101110…
…000101000101
3201002200110211
4212232011011
510044301323
61001315421
7152163313
oct46560505
921080424
1010150213
115803007
123495b71
132145058
1414c30b3
15d5770d
hex9ae145

10150213 has 2 divisors, whose sum is σ = 10150214. Its totient is φ = 10150212.

The previous prime is 10150201. The next prime is 10150219. The reversal of 10150213 is 31205101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7059649 + 3090564 = 2657^2 + 1758^2 .

It is an emirp because it is prime and its reverse (31205101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10150213 - 221 = 8053061 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 210150213 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 10150213 is about 3185.9398927161. The cubic root of 10150213 is about 216.5168592318.

Adding to 10150213 its reverse (31205101), we get a palindrome (41355314).

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