Search a number
-
+
101011112220061 is a prime number
BaseRepresentation
bin10110111101111001111011…
…011101100101010110011101
3111020122120100002100012222201
4112331321323131211112131
5101214431224212020221
6554455510410411501
730163545345203311
oct2675717335452635
9436576302305881
10101011112220061
112a20463254850a
12b3b4769130b91
1344493cb66ab14
141ad2d6cdbbb41
15ba27e6890891
hex5bde7b76559d

101011112220061 has 2 divisors, whose sum is σ = 101011112220062. Its totient is φ = 101011112220060.

The previous prime is 101011112219993. The next prime is 101011112220079. The reversal of 101011112220061 is 160022211110101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 98503342263225 + 2507769956836 = 9924885^2 + 1583594^2 .

It is a cyclic number.

It is not a de Polignac number, because 101011112220061 - 213 = 101011112211869 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2101011112220061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48, while the sum is 19.

Adding to 101011112220061 its reverse (160022211110101), we get a palindrome (261033323330162).

The spelling of 101011112220061 in words is "one hundred one trillion, eleven billion, one hundred twelve million, two hundred twenty thousand, sixty-one".