Search a number
-
+
101110011061 is a prime number
BaseRepresentation
bin101111000101010100…
…0000101010010110101
3100122222112022202011111
41132022220011102311
53124033130323221
6114241014235021
710206412625233
oct1361250052265
9318875282144
10101110011061
1139975a68914
1217719655a71
1396c4787017
144c72647953
15296b8ebbe1
hex178aa054b5

101110011061 has 2 divisors, whose sum is σ = 101110011062. Its totient is φ = 101110011060.

The previous prime is 101110011011. The next prime is 101110011109. The reversal of 101110011061 is 160110011101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 58382640625 + 42727370436 = 241625^2 + 206706^2 .

It is a cyclic number.

It is not a de Polignac number, because 101110011061 - 29 = 101110010549 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2101110011061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 13.

Adding to 101110011061 its reverse (160110011101), we get a palindrome (261220022162).

The spelling of 101110011061 in words is "one hundred one billion, one hundred ten million, eleven thousand, sixty-one".