Search a number
-
+
10053609997 is a prime number
BaseRepresentation
bin10010101110011110…
…11110101000001101
3221221122122022012211
421113033132220031
5131042211004442
64341335430421
7504065163214
oct112717365015
927848568184
1010053609997
11429a000aa2
121b46b25411
13c42b3aa72
146b531a07b
153dc94c617
hex2573dea0d

10053609997 has 2 divisors, whose sum is σ = 10053609998. Its totient is φ = 10053609996.

The previous prime is 10053609967. The next prime is 10053610009. The reversal of 10053609997 is 79990635001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8400455716 + 1653154281 = 91654^2 + 40659^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 10053609997 - 215 = 10053577229 is a prime.

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

It is a congruent number.

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

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

Almost surely, 210053609997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 459270, while the sum is 49.

The spelling of 10053609997 in words is "ten billion, fifty-three million, six hundred nine thousand, nine hundred ninety-seven".