Search a number
-
+
100555051106057 is a prime number
BaseRepresentation
bin10110110111010001001100…
…000110011111111100001001
3111012000222011101220012001012
4112313101030012133330021
5101134443221040343212
6553510204110133305
730115601622534242
oct2667211406377411
9435028141805035
10100555051106057
112a049180980439
12b3402ab1b1235
1344153ba646c92
141ab8c6752bcc9
15b95a03446922
hex5b744c19ff09

100555051106057 has 2 divisors, whose sum is σ = 100555051106058. Its totient is φ = 100555051106056.

The previous prime is 100555051105981. The next prime is 100555051106143. The reversal of 100555051106057 is 750601150555001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 94400578272016 + 6154472834041 = 9715996^2 + 2480821^2 .

It is a cyclic number.

It is not a de Polignac number, because 100555051106057 - 28 = 100555051105801 is a prime.

It is a super-2 number, since 2×1005550511060572 (a number of 29 digits) contains 22 as substring.

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

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

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

Almost surely, 2100555051106057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 131250, while the sum is 41.

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