Search a number
-
+
101106056050561 is a prime number
BaseRepresentation
bin10110111111010010010110…
…100011100011011110000001
3111020222122101212220112121101
4112333102112203203132001
5101223010200322104221
6555011251514254401
730203446215353002
oct2677222643433601
9436878355815541
10101106056050561
112a2409238a1631
12b40b045727401
13445534c7b3393
141ad77b87191a9
15ba5001c7ad91
hex5bf4968e3781

101106056050561 has 2 divisors, whose sum is σ = 101106056050562. Its totient is φ = 101106056050560.

The previous prime is 101106056050553. The next prime is 101106056050579. The reversal of 101106056050561 is 165050650601101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 82510771599936 + 18595284450625 = 9083544^2 + 4312225^2 .

It is a cyclic number.

It is not a de Polignac number, because 101106056050561 - 23 = 101106056050553 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 101106056050561.

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

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

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

Almost surely, 2101106056050561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27000, while the sum is 37.

The spelling of 101106056050561 in words is "one hundred one trillion, one hundred six billion, fifty-six million, fifty thousand, five hundred sixty-one".