Search a number
-
+
101322200010169 is a prime number
BaseRepresentation
bin10111000010011011101001…
…101111010100110110111001
3111021202022022022220100100201
4113002123221233110312321
5101240030331200311134
6555254435345402201
730225200366611435
oct2702335157246671
9437668268810321
10101322200010169
112a31455a494606
12b444b07939361
13446c847651178
141b040409239c5
15baa952680914
hex5c26e9bd4db9

101322200010169 has 2 divisors, whose sum is σ = 101322200010170. Its totient is φ = 101322200010168.

The previous prime is 101322200010131. The next prime is 101322200010191. The reversal of 101322200010169 is 961010002223101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 98188043184144 + 3134156826025 = 9908988^2 + 1770355^2 .

It is a cyclic number.

It is not a de Polignac number, because 101322200010169 - 223 = 101322191621561 is a prime.

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

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

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

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

Almost surely, 2101322200010169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 28.

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