Search a number
-
+
101101110099961 is a prime number
BaseRepresentation
bin10110111111001101101111…
…110000001111111111111001
3111020222011122012020012212211
4112333031233300033333321
5101222420033141144321
6555005113033335121
730203212520436646
oct2677155760177771
9436864565205784
10101101110099961
112a239815a50754
12b40a0a52674a1
134454a41bca0aa
141ad74698c6dcd
15ba4d1294e0e1
hex5bf36fc0fff9

101101110099961 has 2 divisors, whose sum is σ = 101101110099962. Its totient is φ = 101101110099960.

The previous prime is 101101110099937. The next prime is 101101110100007. The reversal of 101101110099961 is 169990011101101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 88109554915561 + 12991555184400 = 9386669^2 + 3604380^2 .

It is a cyclic number.

It is not a de Polignac number, because 101101110099961 - 27 = 101101110099833 is a prime.

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

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

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

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

Almost surely, 2101101110099961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4374, while the sum is 40.

The spelling of 101101110099961 in words is "one hundred one trillion, one hundred one billion, one hundred ten million, ninety-nine thousand, nine hundred sixty-one".