Base | Representation |
---|---|
bin | 10111111011000… |
… | …11100111000101 |
3 | 111222121220110121 |
4 | 23331203213011 |
5 | 402333423041 |
6 | 31525221541 |
7 | 4654542304 |
oct | 1375434705 |
9 | 458556417 |
10 | 200686021 |
11 | a3311418 |
12 | 572618b1 |
13 | 32767633 |
14 | 1c92043b |
15 | 129427d1 |
hex | bf639c5 |
200686021 has 4 divisors (see below), whose sum is σ = 205580844. Its totient is φ = 195791200.
The previous prime is 200686019. The next prime is 200686049. The reversal of 200686021 is 120686002.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 120686002 = 2 ⋅60343001.
It can be written as a sum of positive squares in 2 ways, for example, as 12173121 + 188512900 = 3489^2 + 13730^2 .
It is a cyclic number.
It is not a de Polignac number, because 200686021 - 21 = 200686019 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 (200686121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2447350 + ... + 2447431.
It is an arithmetic number, because the mean of its divisors is an integer number (51395211).
Almost surely, 2200686021 is an apocalyptic number.
It is an amenable number.
200686021 is a deficient number, since it is larger than the sum of its proper divisors (4894823).
200686021 is an equidigital number, since it uses as much as digits as its factorization.
200686021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4894822.
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 200686021 is about 14166.3693655079. The cubic root of 200686021 is about 585.4714304452.
The spelling of 200686021 in words is "two hundred million, six hundred eighty-six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •