Search a number
-
+
101096815032673 is a prime number
BaseRepresentation
bin10110111111001001101111…
…101111110111100101100001
3111020221202112212022012012121
4112333021233233313211201
5101222332234122021143
6555003122523224241
730203001215116615
oct2677115757674541
9436852485265177
10101096815032673
112a237a11552069
12b4092a6978081
134454509116b65
141ad717d2c5345
15ba4b608417ed
hex5bf26fbf7961

101096815032673 has 2 divisors, whose sum is σ = 101096815032674. Its totient is φ = 101096815032672.

The previous prime is 101096815032641. The next prime is 101096815032701. The reversal of 101096815032673 is 376230518690101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 99223453443409 + 1873361589264 = 9961097^2 + 1368708^2 .

It is a cyclic number.

It is not a de Polignac number, because 101096815032673 - 25 = 101096815032641 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (101096815032973) 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, 50548407516336 + 50548407516337.

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

Almost surely, 2101096815032673 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1632960, while the sum is 52.

The spelling of 101096815032673 in words is "one hundred one trillion, ninety-six billion, eight hundred fifteen million, thirty-two thousand, six hundred seventy-three".