Search a number
-
+
101310001112137 is a prime number
BaseRepresentation
bin10111000010010000010010…
…101000001110010001001001
3111021201010211011112010012111
4113002100102220032101021
5101234330340241042022
6555245101052542321
730224256161650156
oct2702202250162111
9437633734463174
10101310001112137
112a30a36a5329a4
12b4426824819a1
13446b652229acc
141b0360472d22d
15baa48b722477
hex5c2412a0e449

101310001112137 has 2 divisors, whose sum is σ = 101310001112138. Its totient is φ = 101310001112136.

The previous prime is 101310001112051. The next prime is 101310001112141. The reversal of 101310001112137 is 731211100013101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 92778718173241 + 8531282938896 = 9632171^2 + 2920836^2 .

It is a cyclic number.

It is not a de Polignac number, because 101310001112137 - 27 = 101310001112009 is a prime.

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

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

Almost surely, 2101310001112137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 126, while the sum is 22.

Adding to 101310001112137 its reverse (731211100013101), we get a palindrome (832521101125238).

The spelling of 101310001112137 in words is "one hundred one trillion, three hundred ten billion, one million, one hundred twelve thousand, one hundred thirty-seven".