Search a number
-
+
100111001000981 is a prime number
BaseRepresentation
bin10110110000110011101000…
…101001110001110000010101
3111010110111222210021121212012
4112300303220221301300111
5101110204312224012411
6552530205311234005
730041531634113015
oct2660635051616025
9433414883247765
10100111001000981
11299979231a4123
12b28a223818905
1343b2571b40809
141aa1580d23c45
15b891b46e518b
hex5b0ce8a71c15

100111001000981 has 2 divisors, whose sum is σ = 100111001000982. Its totient is φ = 100111001000980.

The previous prime is 100111001000951. The next prime is 100111001000999. The reversal of 100111001000981 is 189000100111001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 96495926218756 + 3615074782225 = 9823234^2 + 1901335^2 .

It is a cyclic number.

It is not a de Polignac number, because 100111001000981 - 222 = 100110996806677 is a prime.

It is a super-2 number, since 2×1001110010009812 (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 (100111001000921) by changing a digit.

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

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

Almost surely, 2100111001000981 is an apocalyptic number.

It is an amenable number.

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

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

100111001000981 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 100111001000981 its reverse (189000100111001), we get a palindrome (289111101111982).

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