Search a number
-
+
53633706005377 is a prime number
BaseRepresentation
bin11000011000111100100011…
…11111101001001110000001
321000220022222012002002002201
430030132101333221032001
524012213312214133002
6310022552343513201
714203623143020411
oct1414362177511601
9230808865062081
1053633706005377
11160a8a218a3053
1260226a3758801
1323c0837cbc654
14d35c57094641
1563020839b087
hex30c791fe9381

53633706005377 has 2 divisors, whose sum is σ = 53633706005378. Its totient is φ = 53633706005376.

The previous prime is 53633706005333. The next prime is 53633706005389. The reversal of 53633706005377 is 77350060733635.

53633706005377 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 52272379441296 + 1361326564081 = 7229964^2 + 1166759^2 .

It is a cyclic number.

It is not a de Polignac number, because 53633706005377 - 231 = 53631558521729 is a prime.

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

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

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

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

Almost surely, 253633706005377 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25004700, while the sum is 55.

The spelling of 53633706005377 in words is "fifty-three trillion, six hundred thirty-three billion, seven hundred six million, five thousand, three hundred seventy-seven".