Base | Representation |
---|---|
bin | 11000110100011… |
… | …11101000000101 |
3 | 112111202222101222 |
4 | 30122033220011 |
5 | 411300100331 |
6 | 32354330125 |
7 | 5105503400 |
oct | 1432175005 |
9 | 474688358 |
10 | 208206341 |
11 | a7588562 |
12 | 59889945 |
13 | 3419b625 |
14 | 1d91ad37 |
15 | 1342ab7b |
hex | c68fa05 |
208206341 has 12 divisors (see below), whose sum is σ = 250552620. Its totient is φ = 172307520.
The previous prime is 208206331. The next prime is 208206343. The reversal of 208206341 is 143602802.
It can be written as a sum of positive squares in 2 ways, for example, as 37773316 + 170433025 = 6146^2 + 13055^2 .
It is not a de Polignac number, because 208206341 - 210 = 208205317 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 208206341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (208206343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71840 + ... + 74681.
It is an arithmetic number, because the mean of its divisors is an integer number (20879385).
Almost surely, 2208206341 is an apocalyptic number.
It is an amenable number.
208206341 is a deficient number, since it is larger than the sum of its proper divisors (42346279).
208206341 is a wasteful number, since it uses less digits than its factorization.
208206341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146564 (or 146557 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 208206341 is about 14429.3569156772. The cubic root of 208206341 is about 592.6950734175.
The spelling of 208206341 in words is "two hundred eight million, two hundred six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •