Search a number
-
+
53390847346847 is a prime number
BaseRepresentation
bin11000010001111000001100…
…11111011000100010011111
321000001010002221122221210222
430020330012133120202133
523444223423410044342
6305315225555551555
714150234653335233
oct1410740637304237
9230033087587728
1053390847346847
1116014a274813aa
125ba36068bb5bb
1323a39735c34ca
14d281b8cb25c3
15628c424b9ed2
hex308f067d889f

53390847346847 has 2 divisors, whose sum is σ = 53390847346848. Its totient is φ = 53390847346846.

The previous prime is 53390847346829. The next prime is 53390847346877. The reversal of 53390847346847 is 74864374809335.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 53390847346847 - 26 = 53390847346783 is a prime.

It is a congruent number.

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

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

Almost surely, 253390847346847 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1463132160, while the sum is 71.

The spelling of 53390847346847 in words is "fifty-three trillion, three hundred ninety billion, eight hundred forty-seven million, three hundred forty-six thousand, eight hundred forty-seven".