Base | Representation |
---|---|
bin | 11000100110010… |
… | …00000001110101 |
3 | 112101021011120010 |
4 | 30103020001311 |
5 | 410310341323 |
6 | 32250330433 |
7 | 5053601652 |
oct | 1423100165 |
9 | 471234503 |
10 | 206340213 |
11 | a6523502 |
12 | 59129a19 |
13 | 33997101 |
14 | 1d592c29 |
15 | 131acc93 |
hex | c4c8075 |
206340213 has 8 divisors (see below), whose sum is σ = 276136576. Its totient is φ = 137052000.
The previous prime is 206340163. The next prime is 206340223. The reversal of 206340213 is 312043602.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 206340213 - 214 = 206323829 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 206340213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206340223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 126088 + ... + 127713.
It is an arithmetic number, because the mean of its divisors is an integer number (34517072).
Almost surely, 2206340213 is an apocalyptic number.
It is an amenable number.
206340213 is a deficient number, since it is larger than the sum of its proper divisors (69796363).
206340213 is a wasteful number, since it uses less digits than its factorization.
206340213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254075.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 206340213 is about 14364.5470864904. The cubic root of 206340213 is about 590.9190053943.
Adding to 206340213 its reverse (312043602), we get a palindrome (518383815).
The spelling of 206340213 in words is "two hundred six million, three hundred forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •