Search a number
-
+
102001100000221 is a prime number
BaseRepresentation
bin10111001100010011111011…
…010101010000101111011101
3111101011012200001000011212201
4113030103323111100233131
5101332141223100001341
61000534354120331501
730325223226404122
oct2714237325205735
9441135601004781
10102001100000221
112a556472872454
12b5345b6013b91
1344bb87c55b106
141b28c45800749
15bbd439133331
hex5cc4fb550bdd

102001100000221 has 2 divisors, whose sum is σ = 102001100000222. Its totient is φ = 102001100000220.

The previous prime is 102001100000141. The next prime is 102001100000227. The reversal of 102001100000221 is 122000001100201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 77380787323225 + 24620312676996 = 8796635^2 + 4961886^2 .

It is a cyclic number.

It is not a de Polignac number, because 102001100000221 - 29 = 102001099999709 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 102001100000198 and 102001100000207.

It is a congruent number.

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

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

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

Almost surely, 2102001100000221 is an apocalyptic number.

It is an amenable number.

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

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

102001100000221 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 10.

Adding to 102001100000221 its reverse (122000001100201), we get a palindrome (224001101100422).

The spelling of 102001100000221 in words is "one hundred two trillion, one billion, one hundred million, two hundred twenty-one", and thus it is an aban number.