Search a number
-
+
105204239999 is a prime number
BaseRepresentation
bin110000111111010101…
…0010100111001111111
3101001112212100010102022
41201332222110321333
53210424241134444
6120155151550355
710413026166605
oct1417652247177
9331485303368
10105204239999
11406870616a1
121848082b3bb
139bc7a7b4b1
1451402c9875
152b0b0869ee
hex187ea94e7f

105204239999 has 2 divisors, whose sum is σ = 105204240000. Its totient is φ = 105204239998.

The previous prime is 105204239981. The next prime is 105204240049. The reversal of 105204239999 is 999932402501.

It is a happy number.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 105204239999 - 216 = 105204174463 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2105204239999 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1574640, while the sum is 53.

The spelling of 105204239999 in words is "one hundred five billion, two hundred four million, two hundred thirty-nine thousand, nine hundred ninety-nine".