Search a number
-
+
101106056050537 is a prime number
BaseRepresentation
bin10110111111010010010110…
…100011100011011101101001
3111020222122101212220112120111
4112333102112203203131221
5101223010200322104122
6555011251514254321
730203446215352636
oct2677222643433551
9436878355815514
10101106056050537
112a2409238a160a
12b40b0457273a1
13445534c7b3375
141ad77b871918d
15ba5001c7ad77
hex5bf4968e3769

101106056050537 has 2 divisors, whose sum is σ = 101106056050538. Its totient is φ = 101106056050536.

The previous prime is 101106056050477. The next prime is 101106056050541. The reversal of 101106056050537 is 735050650601101.

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., 91256350846761 + 9849705203776 = 9552819^2 + 3138424^2 .

It is a cyclic number.

It is not a de Polignac number, because 101106056050537 - 27 = 101106056050409 is a prime.

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

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

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

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

Almost surely, 2101106056050537 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 101106056050537 in words is "one hundred one trillion, one hundred six billion, fifty-six million, fifty thousand, five hundred thirty-seven".