Search a number
-
+
101111022010169 is a prime number
BaseRepresentation
bin10110111111010110111110…
…100011001011111100111001
3111021000010012222020102112022
4112333112332203023330321
5101223100333113311134
6555013432352124225
730204013245333233
oct2677267643137471
9437003188212468
10101111022010169
112a242a41a69586
12b40bbb0836675
134455961583c12
141ad7b2a079253
15ba51e2c0b52e
hex5bf5be8cbf39

101111022010169 has 2 divisors, whose sum is σ = 101111022010170. Its totient is φ = 101111022010168.

The previous prime is 101111022010147. The next prime is 101111022010213. The reversal of 101111022010169 is 961010220111101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 96775619251600 + 4335402758569 = 9837460^2 + 2082163^2 .

It is a cyclic number.

It is not a de Polignac number, because 101111022010169 - 228 = 101110753574713 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

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

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

Almost surely, 2101111022010169 is an apocalyptic number.

It is an amenable number.

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

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

101111022010169 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 26.

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