Search a number
-
+
10650625415767 is a prime number
BaseRepresentation
bin1001101011111100101010…
…1111101001101001010111
31101201012010101201220002101
42122333022233221221113
52343444440101301032
634352455121422531
72146324266210541
oct232771257515127
941635111656071
1010650625415767
1134369a54277a7
1212401b4a9aa47
135c34712ac83c
1428b6c8bc4691
151370a94e3de7
hex9afcabe9a57

10650625415767 has 2 divisors, whose sum is σ = 10650625415768. Its totient is φ = 10650625415766.

The previous prime is 10650625415713. The next prime is 10650625415777. The reversal of 10650625415767 is 76751452605601.

It is a strong prime.

It is an emirp because it is prime and its reverse (76751452605601) is a distict prime.

It is a cyclic number.

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

It is a super-2 number, since 2×106506254157672 (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 (10650625415777) by changing a digit.

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

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

Almost surely, 210650625415767 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10584000, while the sum is 55.

The spelling of 10650625415767 in words is "ten trillion, six hundred fifty billion, six hundred twenty-five million, four hundred fifteen thousand, seven hundred sixty-seven".