Base | Representation |
---|---|
bin | 101111011010001110100010… |
… | …101010001101101101111111 |
3 | 1000100021102001200200012210112 |
4 | 233122032202222031231333 |
5 | 204312214004102403033 |
6 | 2015244223151100235 |
7 | 61630246503245534 |
oct | 5732164252155577 |
9 | 1010242050605715 |
10 | 208510506294143 |
11 | 6048a899a442a9 |
12 | 1b47689681167b |
13 | 8c465c18681b1 |
14 | 396bd6899cd8b |
15 | 1918c841a3c48 |
hex | bda3a2a8db7f |
208510506294143 has 2 divisors, whose sum is σ = 208510506294144. Its totient is φ = 208510506294142.
The previous prime is 208510506294131. The next prime is 208510506294161. The reversal of 208510506294143 is 341492605015802.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 208510506294143 - 210 = 208510506293119 is a prime.
It is a super-2 number, since 2×2085105062941432 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 208510506294091 and 208510506294100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (208510506254143) 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, 104255253147071 + 104255253147072.
It is an arithmetic number, because the mean of its divisors is an integer number (104255253147072).
Almost surely, 2208510506294143 is an apocalyptic number.
208510506294143 is a deficient number, since it is larger than the sum of its proper divisors (1).
208510506294143 is an equidigital number, since it uses as much as digits as its factorization.
208510506294143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2073600, while the sum is 50.
The spelling of 208510506294143 in words is "two hundred eight trillion, five hundred ten billion, five hundred six million, two hundred ninety-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •