Search a number
-
+
10649827213 is a prime number
BaseRepresentation
bin10011110101100011…
…10111011110001101
31000111012112021110221
421322301313132031
5133302323432323
64520434431341
7524625015634
oct117261673615
930435467427
1010649827213
1145756058a3
122092732551
13100951090c
1473059a51b
15424e6e55d
hex27ac7778d

10649827213 has 2 divisors, whose sum is σ = 10649827214. Its totient is φ = 10649827212.

The previous prime is 10649827183. The next prime is 10649827231. The reversal of 10649827213 is 31272894601.

Together with next prime (10649827231) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10649827204 + 9 = 103198^2 + 3^2 .

It is a cyclic number.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 10649827213.

It is a congruent number.

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

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

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

Almost surely, 210649827213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 145152, while the sum is 43.

The spelling of 10649827213 in words is "ten billion, six hundred forty-nine million, eight hundred twenty-seven thousand, two hundred thirteen".