Search a number
-
+
9100007011961 is a prime number
BaseRepresentation
bin1000010001101100001010…
…1011110111011001111001
31012012221201010122102012022
42010123002223313121321
52143043303243340321
631204252511524225
71626311441226635
oct204330253673171
935187633572168
109100007011961
1129993227a3438
12102b785b29675
13510185c85c08
1423662aa4ddc5
1510baa334ddab
hex846c2af7679

9100007011961 has 2 divisors, whose sum is σ = 9100007011962. Its totient is φ = 9100007011960.

The previous prime is 9100007011939. The next prime is 9100007011981. The reversal of 9100007011961 is 1691107000019.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5400250936336 + 3699756075625 = 2323844^2 + 1923475^2 .

It is a cyclic number.

It is not a de Polignac number, because 9100007011961 - 210 = 9100007010937 is a prime.

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

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

Almost surely, 29100007011961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3402, while the sum is 35.

The spelling of 9100007011961 in words is "nine trillion, one hundred billion, seven million, eleven thousand, nine hundred sixty-one".