Search a number
-
+
91104940573 is a prime number
BaseRepresentation
bin101010011011001000…
…1110001001000011101
322201011021000111122021
41110312101301020131
52443040331044243
6105504131020141
76403444134433
oct1246621611035
9281137014567
1091104940573
1135701400319
12157a6a3a651
13878ba1297a
1445a3964d53
15258338b6ed
hex153647121d

91104940573 has 2 divisors, whose sum is σ = 91104940574. Its totient is φ = 91104940572.

The previous prime is 91104940571. The next prime is 91104940583. The reversal of 91104940573 is 37504940119.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 89615212164 + 1489728409 = 299358^2 + 38597^2 .

It is a cyclic number.

It is not a de Polignac number, because 91104940573 - 21 = 91104940571 is a prime.

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

Together with 91104940571, it forms a pair of twin primes.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (91104940571) 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, 45552470286 + 45552470287.

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

Almost surely, 291104940573 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 136080, while the sum is 43.

The spelling of 91104940573 in words is "ninety-one billion, one hundred four million, nine hundred forty thousand, five hundred seventy-three".