Search a number
-
+
632649271057 is a prime number
BaseRepresentation
bin10010011010011001101…
…01011100011100010001
32020110222102012212112121
421031030311130130101
540331131203133212
61202345101254241
763464432035126
oct11151465343421
92213872185477
10632649271057
1122433a025141
12a2740b64381
1347873b56bcb
14228984b874d
15116cb35ad07
hex934cd5c711

632649271057 has 2 divisors, whose sum is σ = 632649271058. Its totient is φ = 632649271056.

The previous prime is 632649271027. The next prime is 632649271061. The reversal of 632649271057 is 750172946236.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 493353116881 + 139296154176 = 702391^2 + 373224^2 .

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 2632649271057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3810240, while the sum is 52.

The spelling of 632649271057 in words is "six hundred thirty-two billion, six hundred forty-nine million, two hundred seventy-one thousand, fifty-seven".