Search a number
-
+
94091711969 is a prime number
BaseRepresentation
bin101011110100001001…
…1011001010111100001
322222212102011012202002
41113220103121113201
53020144434240334
6111120343533345
76540452232653
oct1275023312741
9288772135662
1094091711969
11369a4355932
121629b15a255
138b46744c18
1447a84c66d3
1526aa6bab7e
hex15e84d95e1

94091711969 has 2 divisors, whose sum is σ = 94091711970. Its totient is φ = 94091711968.

The previous prime is 94091711849. The next prime is 94091712031. The reversal of 94091711969 is 96911719049.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 76694101969 + 17397610000 = 276937^2 + 131900^2 .

It is an emirp because it is prime and its reverse (96911719049) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 94091711969 - 220 = 94090663393 is a prime.

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

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

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

Almost surely, 294091711969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1102248, while the sum is 56.

The spelling of 94091711969 in words is "ninety-four billion, ninety-one million, seven hundred eleven thousand, nine hundred sixty-nine".