Search a number
-
+
10136993641 is a prime number
BaseRepresentation
bin10010111000011011…
…00011111101101001
3222011110112122001221
421130031203331221
5131230032244031
64353514542041
7506130011215
oct113415437551
928143478057
1010136993641
1143320833a5
121b6aa37921
13c571b42b8
146c2423945
153e4e1da11
hex25c363f69

10136993641 has 2 divisors, whose sum is σ = 10136993642. Its totient is φ = 10136993640.

The previous prime is 10136993611. The next prime is 10136993653. The reversal of 10136993641 is 14639963101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10114526041 + 22467600 = 100571^2 + 4740^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 10136993641 - 27 = 10136993513 is a prime.

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

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

Almost surely, 210136993641 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10136993641 in words is "ten billion, one hundred thirty-six million, nine hundred ninety-three thousand, six hundred forty-one".