Search a number
-
+
100115500673 is a prime number
BaseRepresentation
bin101110100111101011…
…0010100111010000001
3100120102012222101101102
41131033112110322001
53120014032010143
6113554210344145
710142645500106
oct1351726247201
9316365871342
10100115500673
1139505654501
12174a058b055
13959671c736
144bba528aad
15290e4520b8
hex174f594e81

100115500673 has 2 divisors, whose sum is σ = 100115500674. Its totient is φ = 100115500672.

The previous prime is 100115500643. The next prime is 100115500697. The reversal of 100115500673 is 376005511001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 86573058289 + 13542442384 = 294233^2 + 116372^2 .

It is an emirp because it is prime and its reverse (376005511001) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 100115500673 - 212 = 100115496577 is a prime.

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

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

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

Almost surely, 2100115500673 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3150, while the sum is 29.

The spelling of 100115500673 in words is "one hundred billion, one hundred fifteen million, five hundred thousand, six hundred seventy-three".