Search a number
-
+
53060099993 is a prime number
BaseRepresentation
bin110001011010101000…
…001101111110011001
312001221211221100122122
4301122220031332121
51332131341144433
640213034031025
73555610260035
oct613250157631
9161854840578
1053060099993
112055905250a
12a349878475
135007a37894
1427d4cdd1c5
1515a835b198
hexc5aa0df99

53060099993 has 2 divisors, whose sum is σ = 53060099994. Its totient is φ = 53060099992.

The previous prime is 53060099977. The next prime is 53060100013. The reversal of 53060099993 is 39999006035.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 52327477504 + 732622489 = 228752^2 + 27067^2 .

It is a cyclic number.

It is not a de Polignac number, because 53060099993 - 24 = 53060099977 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 253060099993 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 53060099993 in words is "fifty-three billion, sixty million, ninety-nine thousand, nine hundred ninety-three".