Search a number
-
+
101173304054233 is a prime number
BaseRepresentation
bin10111000000010000111110…
…110110010101000111011001
3111021020001222111220002020001
4113000100332312111013121
5101230110411314213413
6555102212500333001
730211346535065515
oct2700207666250731
9437201874802201
10101173304054233
112a2673a2613074
12b4200929a4161
13445b7a8a3a328
141adab57a45145
15ba6b3a9854dd
hex5c043ed951d9

101173304054233 has 2 divisors, whose sum is σ = 101173304054234. Its totient is φ = 101173304054232.

The previous prime is 101173304054161. The next prime is 101173304054297. The reversal of 101173304054233 is 332450403371101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 91968924741849 + 9204379312384 = 9590043^2 + 3033872^2 .

It is a cyclic number.

It is not a de Polignac number, because 101173304054233 - 225 = 101173270499801 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 101173304054192 and 101173304054201.

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

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

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

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

Almost surely, 2101173304054233 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 101173304054233 in words is "one hundred one trillion, one hundred seventy-three billion, three hundred four million, fifty-four thousand, two hundred thirty-three".