Base | Representation |
---|---|
bin | 11000110100011… |
… | …01000111001001 |
3 | 112111202110021111 |
4 | 30122031013021 |
5 | 411244233131 |
6 | 32354210321 |
7 | 5105431354 |
oct | 1432150711 |
9 | 474673244 |
10 | 208196041 |
11 | a7580849 |
12 | 598839a1 |
13 | 34196a31 |
14 | 1d91729b |
15 | 13427ab1 |
hex | c68d1c9 |
208196041 has 9 divisors (see below), whose sum is σ = 213415149. Its totient is φ = 203102604.
The previous prime is 208196039. The next prime is 208196071. The reversal of 208196041 is 140691802.
It is a happy number.
The square root of 208196041 is 14429.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 208196041 - 21 = 208196039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 208195994 and 208196012.
It is not an unprimeable number, because it can be changed into a prime (208196071) 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 8 ways as a sum of consecutive naturals, for example, 678010 + ... + 678316.
Almost surely, 2208196041 is an apocalyptic number.
208196041 is the 14429-th square number.
208196041 is the 7215-th centered octagonal number.
It is an amenable number.
208196041 is a deficient number, since it is larger than the sum of its proper divisors (5219108).
208196041 is an frugal number, since it uses more digits than its factorization.
208196041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708 (or 354 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 31.
The cubic root of 208196041 is about 592.6852996839.
It can be divided in two parts, 208 and 196041, that added together give a square (196249 = 4432).
The spelling of 208196041 in words is "two hundred eight million, one hundred ninety-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •