Search a number
-
+
10051570213 is a prime number
BaseRepresentation
bin10010101110001111…
…01100101000100101
3221221111210200011021
421113013230220211
5131041200221323
64341224011141
7504041636266
oct112707545045
927844720137
1010051570213
114298938523
121b46300ab1
13c425a54a9
146b4d4896d
153dc69805d
hex2571eca25

10051570213 has 2 divisors, whose sum is σ = 10051570214. Its totient is φ = 10051570212.

The previous prime is 10051570163. The next prime is 10051570261. The reversal of 10051570213 is 31207515001.

10051570213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8723186404 + 1328383809 = 93398^2 + 36447^2 .

It is a cyclic number.

It is not a de Polignac number, because 10051570213 - 217 = 10051439141 is a prime.

It is a congruent number.

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

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

Almost surely, 210051570213 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10051570213 in words is "ten billion, fifty-one million, five hundred seventy thousand, two hundred thirteen".