Search a number
-
+
1010221102001 is a prime number
BaseRepresentation
bin11101011001101011101…
…11101011001110110001
310120120120001020012112102
432230311313223032301
5113022413100231001
62052031132110145
7132662135454146
oct16546567531661
93516501205472
101010221102001
1135a483526131
12143955005355
1374356a1b1a7
1436c75ac23cd
151b428c4ae6b
hexeb35deb3b1

1010221102001 has 2 divisors, whose sum is σ = 1010221102002. Its totient is φ = 1010221102000.

The previous prime is 1010221101997. The next prime is 1010221102013. The reversal of 1010221102001 is 1002011220101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 942745844401 + 67475257600 = 970951^2 + 259760^2 .

It is a cyclic number.

It is not a de Polignac number, because 1010221102001 - 22 = 1010221101997 is a prime.

It is a super-3 number, since 3×10102211020013 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

Almost surely, 21010221102001 is an apocalyptic number.

It is an amenable number.

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

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

1010221102001 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 11.

Adding to 1010221102001 its reverse (1002011220101), we get a palindrome (2012232322102).

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