Search a number
-
+
101121201100201 is a prime number
BaseRepresentation
bin10110111111100000011101…
…010001010101010110101001
3111021001002111100222202222211
4112333200131101111112221
5101223232204440201301
6555022234413245121
730204523426223452
oct2677403521252651
9437032440882884
10101121201100201
112a247295884587
12b411b717937a1
1344568c43b7009
141ad8413cda129
15ba55db693051
hex5bf81d4555a9

101121201100201 has 2 divisors, whose sum is σ = 101121201100202. Its totient is φ = 101121201100200.

The previous prime is 101121201100163. The next prime is 101121201100211. The reversal of 101121201100201 is 102001102121101.

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., 59432936444176 + 41688264656025 = 7709276^2 + 6456645^2 .

It is a cyclic number.

It is not a de Polignac number, because 101121201100201 - 223 = 101121192711593 is a prime.

It is a super-4 number, since 4×1011212011002014 (a number of 57 digits) contains 4444 as substring.

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

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

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

Almost surely, 2101121201100201 is an apocalyptic number.

It is an amenable number.

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

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

101121201100201 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 101121201100201 its reverse (102001102121101), we get a palindrome (203122303221302).

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