Search a number
-
+
101022002230141 is a prime number
BaseRepresentation
bin10110111110000100000100…
…100011101011001101111101
3111020200121110000211001102101
4112332010010203223031331
5101220121030032331031
6554504511145225101
730164412250565656
oct2676040443531575
9436617400731371
10101022002230141
112a209210691243
12b3b68a8192191
13444a445864875
141ad36c341a52d
15ba2c32955361
hex5be1048eb37d

101022002230141 has 2 divisors, whose sum is σ = 101022002230142. Its totient is φ = 101022002230140.

The previous prime is 101022002230111. The next prime is 101022002230211. The reversal of 101022002230141 is 141032200220101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 97887080564100 + 3134921666041 = 9893790^2 + 1770571^2 .

It is a cyclic number.

It is not a de Polignac number, because 101022002230141 - 225 = 101021968675709 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2101022002230141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 192, while the sum is 19.

Adding to 101022002230141 its reverse (141032200220101), we get a palindrome (242054202450242).

The spelling of 101022002230141 in words is "one hundred one trillion, twenty-two billion, two million, two hundred thirty thousand, one hundred forty-one".