Search a number
-
+
101111110099513 is a prime number
BaseRepresentation
bin10110111111010111000011…
…110011001110001000111001
3111021000010110002222211101121
4112333113003303032020321
5101223101023141141023
6555013445220145241
730204015365150413
oct2677270363161071
9437003402884347
10101111110099513
112a242a87765398
12b410016238221
1344559768b72a7
141ad7b37a499b3
15ba51ea80bd5d
hex5bf5c3cce239

101111110099513 has 2 divisors, whose sum is σ = 101111110099514. Its totient is φ = 101111110099512.

The previous prime is 101111110099471. The next prime is 101111110099547. The reversal of 101111110099513 is 315990011111101.

It is an a-pointer prime, because the next prime (101111110099547) can be obtained adding 101111110099513 to its sum of digits (34).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 92209408220329 + 8901701879184 = 9602573^2 + 2983572^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 2101111110099513 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 101111110099513 in words is "one hundred one trillion, one hundred eleven billion, one hundred ten million, ninety-nine thousand, five hundred thirteen".