Search a number
-
+
10022011002161 is a prime number
BaseRepresentation
bin1001000111010110111001…
…1001111101110100110001
31022111002120011211000102122
42101311232121331310301
52303200034304032121
633152014233124025
72053031526645254
oct221655631756461
938432504730378
1010022011002161
113214346a347a4
12115a3bb259615
135790c1360262
142690d453509b
15125a674e65ab
hex91d6e67dd31

10022011002161 has 2 divisors, whose sum is σ = 10022011002162. Its totient is φ = 10022011002160.

The previous prime is 10022011002089. The next prime is 10022011002229. The reversal of 10022011002161 is 16120011022001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9896655351025 + 125355651136 = 3145895^2 + 354056^2 .

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

It is a cyclic number.

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

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

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

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

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

Almost surely, 210022011002161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48, while the sum is 17.

Adding to 10022011002161 its reverse (16120011022001), we get a palindrome (26142022024162).

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