Search a number
-
+
1020112100141 is a prime number
BaseRepresentation
bin11101101100000110110…
…10110101101100101101
310121112002100212222012212
432312003122311230231
5113203142144201031
62100344422340205
7133462220532341
oct16660332655455
93545070788185
101020112100141
11363699760462
1214585558a665
1375271c62704
143753358d621
151b80727712b
hexed836b5b2d

1020112100141 has 2 divisors, whose sum is σ = 1020112100142. Its totient is φ = 1020112100140.

The previous prime is 1020112100093. The next prime is 1020112100179. The reversal of 1020112100141 is 1410012110201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 865365062500 + 154747037641 = 930250^2 + 393379^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1020112100141 is a prime.

It is a super-2 number, since 2×10201121001412 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 21020112100141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1020112100141 its reverse (1410012110201), we get a palindrome (2430124210342).

The spelling of 1020112100141 in words is "one trillion, twenty billion, one hundred twelve million, one hundred thousand, one hundred forty-one".