Search a number
-
+
100011010012157 is a prime number
BaseRepresentation
bin10110101111010110100000…
…101110011011001111111101
3111010002221220020121002121202
4112233112200232123033331
5101102040022030342112
6552412231305305245
730031362026535116
oct2657264056331775
9433087806532552
10100011010012157
1129959481963282
12b272978a95225
1343a5cc816783a
141a9a7b716b20d
15b867b118a6c2
hex5af5a0b9b3fd

100011010012157 has 2 divisors, whose sum is σ = 100011010012158. Its totient is φ = 100011010012156.

The previous prime is 100011010012073. The next prime is 100011010012213. The reversal of 100011010012157 is 751210010110001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 70814429747161 + 29196580264996 = 8415131^2 + 5403386^2 .

It is a cyclic number.

It is not a de Polignac number, because 100011010012157 - 230 = 100009936270333 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (100011010062157) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 2100011010012157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 70, while the sum is 20.

Adding to 100011010012157 its reverse (751210010110001), we get a palindrome (851221020122158).

The spelling of 100011010012157 in words is "one hundred trillion, eleven billion, ten million, twelve thousand, one hundred fifty-seven".