Search a number
-
+
100505500057 is a prime number
BaseRepresentation
bin101110110011010011…
…0000011100110011001
3100121102101211101222001
41131212212003212121
53121313402000212
6114101021401001
710155422440414
oct1354646034631
9317371741861
10100505500057
1139695809846
121758b109161
13962946c0c1
144c16248b7b
1529337dc657
hex1766983999

100505500057 has 2 divisors, whose sum is σ = 100505500058. Its totient is φ = 100505500056.

The previous prime is 100505499973. The next prime is 100505500087. The reversal of 100505500057 is 750005505001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 60682902921 + 39822597136 = 246339^2 + 199556^2 .

It is a cyclic number.

It is not a de Polignac number, because 100505500057 - 27 = 100505499929 is a prime.

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

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

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

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

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

Almost surely, 2100505500057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4375, while the sum is 28.

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