Search a number
-
+
91003721101789 is a prime number
BaseRepresentation
bin10100101100010001110100…
…011110000011000111011101
3102221012212111210102020222011
4110230101310132003013131
543412001110100224124
6521314310552151221
725111542021206146
oct2454216436030735
9387185453366864
1091003721101789
1126aa6509110991
12a25916a098511
133ba17ca187942
141868864400acd
15a7c337b26994
hex52c4747831dd

91003721101789 has 2 divisors, whose sum is σ = 91003721101790. Its totient is φ = 91003721101788.

The previous prime is 91003721101693. The next prime is 91003721101801. The reversal of 91003721101789 is 98710112730019.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 75716833177764 + 15286887924025 = 8701542^2 + 3909845^2 .

It is a cyclic number.

It is not a de Polignac number, because 91003721101789 - 223 = 91003712713181 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 291003721101789 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 190512, while the sum is 49.

The spelling of 91003721101789 in words is "ninety-one trillion, three billion, seven hundred twenty-one million, one hundred one thousand, seven hundred eighty-nine".