Search a number
-
+
191011982981 is a prime number
BaseRepresentation
bin1011000111100100110…
…0111000111010000101
3200021000221202010001012
42301321030320322011
511112143031423411
6223425533412005
716541312031521
oct2617114707205
9607027663035
10191011982981
117400a314a66
123102963a005
13150211a6201
149360508d81
154e7e36318b
hex2c79338e85

191011982981 has 2 divisors, whose sum is σ = 191011982982. Its totient is φ = 191011982980.

The previous prime is 191011982971. The next prime is 191011983007. The reversal of 191011982981 is 189289110191.

191011982981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 190261716100 + 750266881 = 436190^2 + 27391^2 .

It is a cyclic number.

It is not a de Polignac number, because 191011982981 - 214 = 191011966597 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2191011982981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 93312, while the sum is 50.

The spelling of 191011982981 in words is "one hundred ninety-one billion, eleven million, nine hundred eighty-two thousand, nine hundred eighty-one".