Search a number
-
+
101015144557 is a prime number
BaseRepresentation
bin101111000010011111…
…0001100100001101101
3100122201220211000210021
41132010332030201231
53123334334111212
6114223345042141
710204151363425
oct1360476144155
9318656730707
10101015144557
1139927463248
12176b1926351
1396aac1ccb2
144c63bd1485
15296340d307
hex1784f8c86d

101015144557 has 2 divisors, whose sum is σ = 101015144558. Its totient is φ = 101015144556.

The previous prime is 101015144449. The next prime is 101015144567. The reversal of 101015144557 is 755441510101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 69113255236 + 31901889321 = 262894^2 + 178611^2 .

It is a cyclic number.

It is not a de Polignac number, because 101015144557 - 27 = 101015144429 is a prime.

It is a congruent number.

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

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

Almost surely, 2101015144557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14000, while the sum is 34.

Adding to 101015144557 its reverse (755441510101), we get a palindrome (856456654658).

The spelling of 101015144557 in words is "one hundred one billion, fifteen million, one hundred forty-four thousand, five hundred fifty-seven".