Search a number
-
+
100866516498239 is a prime number
BaseRepresentation
bin10110111011110011010000…
…111000101011011100111111
3111020010202002221222111002012
4112323303100320223130333
5101210044111210420424
6554305234334321435
730150236210640152
oct2673632070533477
9436122087874065
10100866516498239
112a159281a84568
12b39073435927b
134438896928bcb
141ac9d73287c99
15b9db82473b0e
hex5bbcd0e2b73f

100866516498239 has 2 divisors, whose sum is σ = 100866516498240. Its totient is φ = 100866516498238.

The previous prime is 100866516498211. The next prime is 100866516498329. The reversal of 100866516498239 is 932894615668001.

Together with next prime (100866516498329) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 100866516498239 - 220 = 100866515449663 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2100866516498239 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 134369280, while the sum is 68.

The spelling of 100866516498239 in words is "one hundred trillion, eight hundred sixty-six billion, five hundred sixteen million, four hundred ninety-eight thousand, two hundred thirty-nine".