Search a number
-
+
62389326053 is a prime number
BaseRepresentation
bin111010000110101100…
…011001000011100101
312222001000112010220202
4322012230121003211
52010233131413203
644354455440245
74336031343605
oct720654310345
9188030463822
1062389326053
112450616a09a
1210112086085
135b637795a2
14303bd34c05
1519523bb388
hexe86b190e5

62389326053 has 2 divisors, whose sum is σ = 62389326054. Its totient is φ = 62389326052.

The previous prime is 62389326031. The next prime is 62389326073. The reversal of 62389326053 is 35062398326.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 38065180609 + 24324145444 = 195103^2 + 155962^2 .

It is a cyclic number.

It is not a de Polignac number, because 62389326053 - 212 = 62389321957 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 262389326053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1399680, while the sum is 47.

It can be divided in two parts, 623893 and 26053, that added together give a palindrome (649946).

The spelling of 62389326053 in words is "sixty-two billion, three hundred eighty-nine million, three hundred twenty-six thousand, fifty-three".