Search a number
-
+
102021222110053 is a prime number
BaseRepresentation
bin10111001100100110101010…
…101101000001001101100101
3111101020010121101022021022211
4113030212222231001031211
5101333003430330010203
61000551522531123421
730326534663460301
oct2714465255011545
9441203541267284
10102021222110053
112a563a59214394
12b538490a43571
1344c073831b08c
141b29bd3dd0d01
15bbdc1596ec6d
hex5cc9aab41365

102021222110053 has 2 divisors, whose sum is σ = 102021222110054. Its totient is φ = 102021222110052.

The previous prime is 102021222110033. The next prime is 102021222110083. The reversal of 102021222110053 is 350011222120201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 66099143899044 + 35922078211009 = 8130138^2 + 5993503^2 .

It is a cyclic number.

It is not a de Polignac number, because 102021222110053 - 241 = 99822198854501 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (102021222110033) 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, 51010611055026 + 51010611055027.

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

Almost surely, 2102021222110053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 480, while the sum is 22.

Adding to 102021222110053 its reverse (350011222120201), we get a palindrome (452032444230254).

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