Base | Representation |
---|---|
bin | 11000101001000… |
… | …01010100101001 |
3 | 112101221202021100 |
4 | 30110201110221 |
5 | 410404042321 |
6 | 32302232013 |
7 | 5056654200 |
oct | 1424412451 |
9 | 471852240 |
10 | 206705961 |
11 | a6753280 |
12 | 59285609 |
13 | 33a94727 |
14 | 1d64a237 |
15 | 13231326 |
hex | c521529 |
206705961 has 36 divisors (see below), whose sum is σ = 378905904. Its totient is φ = 107377200.
The previous prime is 206705929. The next prime is 206705963. The reversal of 206705961 is 169507602.
206705961 is a `hidden beast` number, since 2 + 0 + 67 + 0 + 596 + 1 = 666.
It is not a de Polignac number, because 206705961 - 25 = 206705929 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (206705963) 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 35 ways as a sum of consecutive naturals, for example, 16455 + ... + 26156.
It is an arithmetic number, because the mean of its divisors is an integer number (10525164).
Almost surely, 2206705961 is an apocalyptic number.
206705961 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
206705961 is a deficient number, since it is larger than the sum of its proper divisors (172199943).
206705961 is a wasteful number, since it uses less digits than its factorization.
206705961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42642 (or 42632 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The square root of 206705961 is about 14377.2723769149. The cubic root of 206705961 is about 591.2679434710.
The spelling of 206705961 in words is "two hundred six million, seven hundred five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •