Search a number
-
+
10645654013 is a prime number
BaseRepresentation
bin10011110101000011…
…11100100111111101
31000110220200020220222
421322201330213331
5133300241412023
64520205151125
7524544365111
oct117241744775
930426606828
1010645654013
114573215475
12209125b4a5
1310086ac277
1472dbd1741
154248e7cc8
hex27a87c9fd

10645654013 has 2 divisors, whose sum is σ = 10645654014. Its totient is φ = 10645654012.

The previous prime is 10645654003. The next prime is 10645654081. The reversal of 10645654013 is 31045654601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9074086564 + 1571567449 = 95258^2 + 39643^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×106456540132 (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 (10645654003) by changing a digit.

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

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

Almost surely, 210645654013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10645654013 in words is "ten billion, six hundred forty-five million, six hundred fifty-four thousand, thirteen".