Search a number
-
+
101011000100141 is a prime number
BaseRepresentation
bin10110111101111001110100…
…110001111000010100101101
3111020122120001021100221101002
4112331321310301320110231
5101214431012011201031
6554455451323330045
730163542514202135
oct2675716461702455
9436576037327332
10101011000100141
112a20458522911a
12b3b4737680925
1344493b1372881
141ad2d5c153ac5
15ba27dbae4ccb
hex5bde74c7852d

101011000100141 has 2 divisors, whose sum is σ = 101011000100142. Its totient is φ = 101011000100140.

The previous prime is 101011000100107. The next prime is 101011000100161. The reversal of 101011000100141 is 141001000110101.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 56369613520900 + 44641386579241 = 7507970^2 + 6681421^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 2101011000100141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 101011000100141 its reverse (141001000110101), we get a palindrome (242012000210242).

The spelling of 101011000100141 in words is "one hundred one trillion, eleven billion, one hundred thousand, one hundred forty-one".