Base | Representation |
---|---|
bin | 11000100100101… |
… | …11101000011101 |
3 | 112100220002122012 |
4 | 30102113220131 |
5 | 410233020411 |
6 | 32242201005 |
7 | 5052115013 |
oct | 1422275035 |
9 | 470802565 |
10 | 206141981 |
11 | a63a8581 |
12 | 59053165 |
13 | 33927b06 |
14 | 1d5408b3 |
15 | 1316e18b |
hex | c497a1d |
206141981 has 4 divisors (see below), whose sum is σ = 206352672. Its totient is φ = 205931292.
The previous prime is 206141977. The next prime is 206141987. The reversal of 206141981 is 189141602.
206141981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 not a de Polignac number, because 206141981 - 22 = 206141977 is a prime.
It is a super-2 number, since 2×2061419812 = 84989032661208722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206141987) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 103871 + ... + 105836.
It is an arithmetic number, because the mean of its divisors is an integer number (51588168).
Almost surely, 2206141981 is an apocalyptic number.
It is an amenable number.
206141981 is a deficient number, since it is larger than the sum of its proper divisors (210691).
206141981 is an equidigital number, since it uses as much as digits as its factorization.
206141981 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210690.
The product of its (nonzero) digits is 3456, while the sum is 32.
The square root of 206141981 is about 14357.6453849508. The cubic root of 206141981 is about 590.7297118863.
The spelling of 206141981 in words is "two hundred six million, one hundred forty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •