Search a number
-
+
10634685066157 is a prime number
BaseRepresentation
bin1001101011000001010010…
…1000000010101110101101
31101122122222111011020020111
42122300110220002232231
52343214313334104112
634341301252420021
72145221260400215
oct232602450025655
941578874136214
1010634685066157
113430165524149
1212390a6617611
135c1b009b03c9
1428aa15b3d245
15136974d825a7
hex9ac14a02bad

10634685066157 has 2 divisors, whose sum is σ = 10634685066158. Its totient is φ = 10634685066156.

The previous prime is 10634685066097. The next prime is 10634685066211. The reversal of 10634685066157 is 75166058643601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7856242804201 + 2778442261956 = 2802899^2 + 1666866^2 .

It is a cyclic number.

It is not a de Polignac number, because 10634685066157 - 231 = 10632537582509 is a prime.

It is a super-2 number, since 2×106346850661572 (a number of 27 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 210634685066157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21772800, while the sum is 58.

The spelling of 10634685066157 in words is "ten trillion, six hundred thirty-four billion, six hundred eighty-five million, sixty-six thousand, one hundred fifty-seven".