Base | Representation |
---|---|
bin | 101111010101000110011110… |
… | …110100100001110110111101 |
3 | 1000022000201211122220121212221 |
4 | 233111012132310201312331 |
5 | 204240431101132232231 |
6 | 2014414325414125341 |
7 | 61562636412065563 |
oct | 5725063664416675 |
9 | 1008021748817787 |
10 | 208158254570941 |
11 | 60364469037a94 |
12 | 1b41a56a350851 |
13 | 8c1c31562869c |
14 | 3958cb0067a33 |
15 | 190ea19617d11 |
hex | bd519ed21dbd |
208158254570941 has 2 divisors, whose sum is σ = 208158254570942. Its totient is φ = 208158254570940.
The previous prime is 208158254570873. The next prime is 208158254570971. The reversal of 208158254570941 is 149075452851802.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 181980234900025 + 26178019670916 = 13490005^2 + 5116446^2 .
It is a cyclic number.
It is not a de Polignac number, because 208158254570941 - 27 = 208158254570813 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 208158254570941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (208158254570971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 104079127285470 + 104079127285471.
It is an arithmetic number, because the mean of its divisors is an integer number (104079127285471).
Almost surely, 2208158254570941 is an apocalyptic number.
It is an amenable number.
208158254570941 is a deficient number, since it is larger than the sum of its proper divisors (1).
208158254570941 is an equidigital number, since it uses as much as digits as its factorization.
208158254570941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32256000, while the sum is 61.
The spelling of 208158254570941 in words is "two hundred eight trillion, one hundred fifty-eight billion, two hundred fifty-four million, five hundred seventy thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •