Search a number
-
+
10573436213 is a prime number
BaseRepresentation
bin10011101100011100…
…11101010100110101
31000021212210012201122
421312032131110311
5133123244424323
64505105233325
7523006503434
oct116616352465
930255705648
1010573436213
11453647a13a
122071032845
13cc6745142
1472439311b
1541d3ceec8
hex27639d535

10573436213 has 2 divisors, whose sum is σ = 10573436214. Its totient is φ = 10573436212.

The previous prime is 10573436201. The next prime is 10573436243. The reversal of 10573436213 is 31263437501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8592919204 + 1980517009 = 92698^2 + 44503^2 .

It is a cyclic number.

It is not a de Polignac number, because 10573436213 - 26 = 10573436149 is a prime.

It is a super-2 number, since 2×105734362132 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 210573436213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 45360, while the sum is 35.

The spelling of 10573436213 in words is "ten billion, five hundred seventy-three million, four hundred thirty-six thousand, two hundred thirteen".