Search a number
-
+
632537336113 is a prime number
BaseRepresentation
bin10010011010001100010…
…10011100100100110001
32020110200121120222122221
421031012022130210301
540330414024223423
61202330022201041
763461602434154
oct11150612344461
92213617528587
10632537336113
11224291921821
12a270b583181
13478568c4c07
142288769bc9b
15116c15e9e5d
hex934629c931

632537336113 has 2 divisors, whose sum is σ = 632537336114. Its totient is φ = 632537336112.

The previous prime is 632537336087. The next prime is 632537336159. The reversal of 632537336113 is 311633735236.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 630289912464 + 2247423649 = 793908^2 + 47407^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 2632537336113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 612360, while the sum is 43.

The spelling of 632537336113 in words is "six hundred thirty-two billion, five hundred thirty-seven million, three hundred thirty-six thousand, one hundred thirteen".