Search a number
-
+
53992099061 is a prime number
BaseRepresentation
bin110010010010001011…
…100000110011110101
312011100210122211000122
4302102023200303311
51341033434132221
640445330021325
73620655161345
oct622213406365
9164323584018
1053992099061
112099715017a
12a569a17845
135125b56114
1428829c8d25
1516100a8eab
hexc922e0cf5

53992099061 has 2 divisors, whose sum is σ = 53992099062. Its totient is φ = 53992099060.

The previous prime is 53992099027. The next prime is 53992099067. The reversal of 53992099061 is 16099029935.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 53800802500 + 191296561 = 231950^2 + 13831^2 .

It is a cyclic number.

It is not a de Polignac number, because 53992099061 - 210 = 53992098037 is a prime.

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

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 253992099061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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