Search a number
-
+
102111020000053 is a prime number
BaseRepresentation
bin10111001101111010010011…
…000100110010001100110101
3111101112201101112212201122121
4113031322103010302030311
5101340441332110000203
61001101053251355541
730336164160111001
oct2715722304621465
9441481345781577
10102111020000053
112a599049841219
12b551971bb2bb1
1344c90492c782c
141b302b211b701
15bc121e1c70bd
hex5cde93132335

102111020000053 has 2 divisors, whose sum is σ = 102111020000054. Its totient is φ = 102111020000052.

The previous prime is 102111019999973. The next prime is 102111020000107. The reversal of 102111020000053 is 350000020111201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 96962581853764 + 5148438146289 = 9846958^2 + 2269017^2 .

It is a cyclic number.

It is not a de Polignac number, because 102111020000053 - 217 = 102111019868981 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2102111020000053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 60, while the sum is 16.

Adding to 102111020000053 its reverse (350000020111201), we get a palindrome (452111040111254).

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