Search a number
-
+
100001001101311 is a prime number
BaseRepresentation
bin10110101111001101001100…
…001001011101011111111111
3111010002000001201001202010001
4112233031030021131133333
5101101404022240220221
6552403454203455131
730030556013311042
oct2657151411353777
9433060051052101
10100001001101311
1129955206112432
12b270a44b274a7
1343a509167a49b
141a9a107b68c59
15b863c761c391
hex5af34c25d7ff

100001001101311 has 2 divisors, whose sum is σ = 100001001101312. Its totient is φ = 100001001101310.

The previous prime is 100001001101297. The next prime is 100001001101321. The reversal of 100001001101311 is 113101100100001.

It is an a-pointer prime, because the next prime (100001001101321) can be obtained adding 100001001101311 to its sum of digits (10).

It is a strong prime.

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 2100001001101311 is an apocalyptic number.

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

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

100001001101311 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 100001001101311 its reverse (113101100100001), we get a palindrome (213102101201312).

The spelling of 100001001101311 in words is "one hundred trillion, one billion, one million, one hundred one thousand, three hundred eleven".