Search a number
-
+
53890031969 is a prime number
BaseRepresentation
bin110010001100000110…
…001010000101100001
312011002200121021021222
4302030012022011201
51340331322010334
640431242224425
73615305466554
oct621406120541
9164080537258
1053890031969
1120944577704
12a53b7b5115
13510a96a7a7
14287321a69b
151606146d2e
hexc8c18a161

53890031969 has 2 divisors, whose sum is σ = 53890031970. Its totient is φ = 53890031968.

The previous prime is 53890031917. The next prime is 53890031989. The reversal of 53890031969 is 96913009835.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 29620131025 + 24269900944 = 172105^2 + 155788^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-53890031969 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

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

Almost surely, 253890031969 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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