Search a number
-
+
100101110122201 is a prime number
BaseRepresentation
bin10110110000101010011011…
…000111000100011011011001
3111010102120110110211220220111
4112300222123013010123121
5101110024033142402301
6552521452023324321
730041031553042516
oct2660523307043331
9433376413756814
10100101110122201
1129993708040541
12b2883232b06a1
1343b165693b716
141aa0cc348830d
15b88cd61de551
hex5b0a9b1c46d9

100101110122201 has 2 divisors, whose sum is σ = 100101110122202. Its totient is φ = 100101110122200.

The previous prime is 100101110122127. The next prime is 100101110122241. The reversal of 100101110122201 is 102221011101001.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 85472780032201 + 14628330090000 = 9245149^2 + 3824700^2 .

It is a cyclic number.

It is not a de Polignac number, because 100101110122201 - 27 = 100101110122073 is a prime.

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

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

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

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

Almost surely, 2100101110122201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8, while the sum is 13.

Adding to 100101110122201 its reverse (102221011101001), we get a palindrome (202322121223202).

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