Search a number
-
+
100021111110161 is a prime number
BaseRepresentation
bin10110101111011111111010…
…110011000011101000010001
3111010010220222012121001010122
4112233133322303003220101
5101102221213421011121
6552421021503040025
730032200242464333
oct2657377263035021
9433126865531118
10100021111110161
112996279574975a
12b2749178a0015
1343a6c47a914c7
141a9b0948c9453
15b86ba2d685ab
hex5af7facc3a11

100021111110161 has 2 divisors, whose sum is σ = 100021111110162. Its totient is φ = 100021111110160.

The previous prime is 100021111110133. The next prime is 100021111110299. The reversal of 100021111110161 is 161011111120001.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 99090696533761 + 930414576400 = 9954431^2 + 964580^2 .

It is a cyclic number.

It is not a de Polignac number, because 100021111110161 - 210 = 100021111109137 is a prime.

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

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

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

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

Almost surely, 2100021111110161 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 100021111110161 its reverse (161011111120001), we get a palindrome (261032222230162).

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