Base | Representation |
---|---|
bin | 11000101001110… |
… | …10000000001101 |
3 | 112102010212221111 |
4 | 30110322000031 |
5 | 410420311203 |
6 | 32304332021 |
7 | 5060555005 |
oct | 1424720015 |
9 | 472125844 |
10 | 206807053 |
11 | a6812222 |
12 | 59314011 |
13 | 33acb74b |
14 | 1d675005 |
15 | 1325126d |
hex | c53a00d |
206807053 has 4 divisors (see below), whose sum is σ = 215798688. Its totient is φ = 197815420.
The previous prime is 206807047. The next prime is 206807071. The reversal of 206807053 is 350708602.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-206807053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206807093) 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 3 ways as a sum of consecutive naturals, for example, 4495783 + ... + 4495828.
It is an arithmetic number, because the mean of its divisors is an integer number (53949672).
Almost surely, 2206807053 is an apocalyptic number.
206807053 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
206807053 is a deficient number, since it is larger than the sum of its proper divisors (8991635).
206807053 is an equidigital number, since it uses as much as digits as its factorization.
206807053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8991634.
The product of its (nonzero) digits is 10080, while the sum is 31.
The square root of 206807053 is about 14380.7876348968. The cubic root of 206807053 is about 591.3643166270.
The spelling of 206807053 in words is "two hundred six million, eight hundred seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •