Base | Representation |
---|---|
bin | 11000110111011… |
… | …11000011111001 |
3 | 112112111211121202 |
4 | 30123233003321 |
5 | 411400102431 |
6 | 32410543545 |
7 | 5112022136 |
oct | 1433570371 |
9 | 475454552 |
10 | 208597241 |
11 | a7825216 |
12 | 59a37bb5 |
13 | 342a7528 |
14 | 1d9bd58d |
15 | 134a68cb |
hex | c6ef0f9 |
208597241 has 4 divisors (see below), whose sum is σ = 212533092. Its totient is φ = 204661392.
The previous prime is 208597237. The next prime is 208597267. The reversal of 208597241 is 142795802.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 100000000 + 108597241 = 10000^2 + 10421^2 .
It is a cyclic number.
It is not a de Polignac number, because 208597241 - 22 = 208597237 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 208597195 and 208597204.
It is not an unprimeable number, because it can be changed into a prime (208597141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1967846 + ... + 1967951.
It is an arithmetic number, because the mean of its divisors is an integer number (53133273).
Almost surely, 2208597241 is an apocalyptic number.
It is an amenable number.
208597241 is a deficient number, since it is larger than the sum of its proper divisors (3935851).
208597241 is an equidigital number, since it uses as much as digits as its factorization.
208597241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3935850.
The product of its (nonzero) digits is 40320, while the sum is 38.
The square root of 208597241 is about 14442.8958661343. The cubic root of 208597241 is about 593.0657628355.
The spelling of 208597241 in words is "two hundred eight million, five hundred ninety-seven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •