Search a number
-
+
53968099477 is a prime number
BaseRepresentation
bin110010010000101111…
…111101100010010101
312011022010111111210011
4302100233331202111
51341011313140402
640443111400221
73620244163615
oct622057754225
9164263444704
1053968099477
1120984648a06
12a561983071
135120ba2396
14287d73ca45
15160ce17ed7
hexc90bfd895

53968099477 has 2 divisors, whose sum is σ = 53968099478. Its totient is φ = 53968099476.

The previous prime is 53968099457. The next prime is 53968099489. The reversal of 53968099477 is 77499086935.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 53752567716 + 215531761 = 231846^2 + 14681^2 .

It is a cyclic number.

It is not a de Polignac number, because 53968099477 - 27 = 53968099349 is a prime.

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

It is a congruent number.

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

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

Almost surely, 253968099477 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 102876480, while the sum is 67.

The spelling of 53968099477 in words is "fifty-three billion, nine hundred sixty-eight million, ninety-nine thousand, four hundred seventy-seven".