Search a number
-
+
101221100201093 is a prime number
BaseRepresentation
bin10111000000111101011111…
…101110001010010010000101
3111021101122100111202220200112
4113000331133232022102011
5101231401303122413333
6555140155333522405
730214661136453455
oct2700753756122205
9437348314686615
10101221100201093
112a28569a264694
12b4293b17a3405
134463155029932
141add1ad7b3d65
15ba7ed6aeb948
hex5c0f5fb8a485

101221100201093 has 2 divisors, whose sum is σ = 101221100201094. Its totient is φ = 101221100201092.

The previous prime is 101221100201077. The next prime is 101221100201129. The reversal of 101221100201093 is 390102001122101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 78858964386049 + 22362135815044 = 8880257^2 + 4728862^2 .

It is a cyclic number.

It is not a de Polignac number, because 101221100201093 - 24 = 101221100201077 is a prime.

It is a super-2 number, since 2×1012211002010932 (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 (101221100201593) by changing a digit.

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

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

Almost surely, 2101221100201093 is an apocalyptic number.

It is an amenable number.

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

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

101221100201093 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 216, while the sum is 23.

Adding to 101221100201093 its reverse (390102001122101), we get a palindrome (491323101323194).

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