Base | Representation |
---|---|
bin | 11000100100110… |
… | …10000111101001 |
3 | 112100220121121112 |
4 | 30102122013221 |
5 | 410233332134 |
6 | 32242320105 |
7 | 5052156506 |
oct | 1422320751 |
9 | 470817545 |
10 | 206152169 |
11 | a64051a3 |
12 | 59059035 |
13 | 3392c642 |
14 | 1d5444ad |
15 | 131721ce |
hex | c49a1e9 |
206152169 has 2 divisors, whose sum is σ = 206152170. Its totient is φ = 206152168.
The previous prime is 206152153. The next prime is 206152171. The reversal of 206152169 is 961251602.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 202777600 + 3374569 = 14240^2 + 1837^2 .
It is a cyclic number.
It is not a de Polignac number, because 206152169 - 24 = 206152153 is a prime.
It is a super-2 number, since 2×2061521692 = 84997433566809122, which contains 22 as substring.
Together with 206152171, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (206152189) 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 as a sum of consecutive naturals, namely, 103076084 + 103076085.
It is an arithmetic number, because the mean of its divisors is an integer number (103076085).
Almost surely, 2206152169 is an apocalyptic number.
It is an amenable number.
206152169 is a deficient number, since it is larger than the sum of its proper divisors (1).
206152169 is an equidigital number, since it uses as much as digits as its factorization.
206152169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 32.
The square root of 206152169 is about 14358.0001741190. Note that the first 3 decimals coincide. The cubic root of 206152169 is about 590.7394434560.
The spelling of 206152169 in words is "two hundred six million, one hundred fifty-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •