Search a number
-
+
5153660536553 is a prime number
BaseRepresentation
bin100101011111110111000…
…0110110000011011101001
3200020200111110112011102122
41022333232012300123221
51133414144044132203
614543320423041025
71041224340525464
oct112775606603351
920220443464378
105153660536553
111707723020a31
126b29925a0175
132b4cacb2aa89
1413b61d3642db
158e0d286e538
hex4afee1b06e9

5153660536553 has 2 divisors, whose sum is σ = 5153660536554. Its totient is φ = 5153660536552.

The previous prime is 5153660536537. The next prime is 5153660536571. The reversal of 5153660536553 is 3556350663515.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3458904394969 + 1694756141584 = 1859813^2 + 1301828^2 .

It is a cyclic number.

It is not a de Polignac number, because 5153660536553 - 24 = 5153660536537 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 5153660536495 and 5153660536504.

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

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

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

Almost surely, 25153660536553 is an apocalyptic number.

It is an amenable number.

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

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

5153660536553 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 18225000, while the sum is 53.

The spelling of 5153660536553 in words is "five trillion, one hundred fifty-three billion, six hundred sixty million, five hundred thirty-six thousand, five hundred fifty-three".