Search a number
-
+
91103621131 is a prime number
BaseRepresentation
bin101010011011000110…
…0101111000000001011
322201011011112110201001
41110312030233000023
52443040011334011
6105504042435431
76403430000605
oct1246614570013
9281134473631
1091103621131
1135700689a76
12157a6502b77
13878b670233
1445a3700175
1525831ca7c1
hex153632f00b

91103621131 has 2 divisors, whose sum is σ = 91103621132. Its totient is φ = 91103621130.

The previous prime is 91103621093. The next prime is 91103621153. The reversal of 91103621131 is 13112630119.

It is a strong prime.

It is a cyclic number.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 91103621131.

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

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

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

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

Almost surely, 291103621131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 28.

The spelling of 91103621131 in words is "ninety-one billion, one hundred three million, six hundred twenty-one thousand, one hundred thirty-one".