Search a number
-
+
10011010111169 is a prime number
BaseRepresentation
bin1001000110101101111010…
…1100111001011011000001
31022110001011111200211222112
42101223132230321123001
52303010022042024134
633142554453545105
72052162106631624
oct221533654713301
938401144624875
1010011010111169
11320a711248551
12115824b045195
1357805a1b31c2
1426876d4b1dbb
1512562182d1ce
hex91adeb396c1

10011010111169 has 2 divisors, whose sum is σ = 10011010111170. Its totient is φ = 10011010111168.

The previous prime is 10011010111093. The next prime is 10011010111213. The reversal of 10011010111169 is 96111101011001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9917536220944 + 93473890225 = 3149212^2 + 305735^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 210011010111169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 23.

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