Search a number
-
+
10001022111169 is a prime number
BaseRepresentation
bin1001000110001000101101…
…0111101100110111000001
31022102002101102111212202121
42101202023113230313001
52302324043130024134
633134223420244241
72051356436216245
oct221421327546701
938362342455677
1010001022111169
11320645628a2a1
1211563220a0681
13577127b37a2b
142680a2b94425
15125239a40ab4
hex9188b5ecdc1

10001022111169 has 2 divisors, whose sum is σ = 10001022111170. Its totient is φ = 10001022111168.

The previous prime is 10001022111167. The next prime is 10001022111239. The reversal of 10001022111169 is 96111122010001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6459425571600 + 3541596539569 = 2541540^2 + 1881913^2 .

It is a cyclic number.

It is not a de Polignac number, because 10001022111169 - 21 = 10001022111167 is a prime.

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

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

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

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

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

Almost surely, 210001022111169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 216, while the sum is 25.

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