Base | Representation |
---|---|
bin | 110000111111010101… |
… | …0010100111001111111 |
3 | 101001112212100010102022 |
4 | 1201332222110321333 |
5 | 3210424241134444 |
6 | 120155151550355 |
7 | 10413026166605 |
oct | 1417652247177 |
9 | 331485303368 |
10 | 105204239999 |
11 | 406870616a1 |
12 | 1848082b3bb |
13 | 9bc7a7b4b1 |
14 | 51402c9875 |
15 | 2b0b0869ee |
hex | 187ea94e7f |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •