Search a number
-
+
100101011000981 is a prime number
BaseRepresentation
bin10110110000101010010101…
…001100111100111010010101
3111010102120012120100001011012
4112300222111030330322111
5101110023332304012411
6552521434123022005
730041026240400414
oct2660522514747225
9433376176301135
10100101011000981
112999366709a281
12b2882b606a905
1343b163c244c03
141aa0cb424547b
15b88ccc66018b
hex5b0a9533ce95

100101011000981 has 2 divisors, whose sum is σ = 100101011000982. Its totient is φ = 100101011000980.

The previous prime is 100101011000929. The next prime is 100101011001023. The reversal of 100101011000981 is 189000110101001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 94634159104081 + 5466851896900 = 9728009^2 + 2338130^2 .

It is a cyclic number.

It is not a de Polignac number, because 100101011000981 - 218 = 100101010738837 is a prime.

It is a super-2 number, since 2×1001010110009812 (a number of 29 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 2100101011000981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 72, while the sum is 23.

Adding to 100101011000981 its reverse (189000110101001), we get a palindrome (289101121101982).

The spelling of 100101011000981 in words is "one hundred trillion, one hundred one billion, eleven million, nine hundred eighty-one", and thus it is an aban number.