Search a number
-
+
101377741027133 is a prime number
BaseRepresentation
bin10111000011001111011000…
…001111011111011100111101
3111021221121200002010100022002
4113003033120033133130331
5101241433103200332013
6555340142530232045
730232204633510544
oct2703173017373475
9437847602110262
10101377741027133
112a33607099671a
12b453828425625
134474b5936624c
141b069cd10715b
15bac1036e8358
hex5c33d83df73d

101377741027133 has 2 divisors, whose sum is σ = 101377741027134. Its totient is φ = 101377741027132.

The previous prime is 101377741027117. The next prime is 101377741027183. The reversal of 101377741027133 is 331720147773101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 85770603382564 + 15607137644569 = 9261242^2 + 3950587^2 .

It is a cyclic number.

It is not a de Polignac number, because 101377741027133 - 24 = 101377741027117 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2101377741027133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 518616, while the sum is 47.

The spelling of 101377741027133 in words is "one hundred one trillion, three hundred seventy-seven billion, seven hundred forty-one million, twenty-seven thousand, one hundred thirty-three".