Base | Representation |
---|---|
bin | 1100000001101001100… |
… | …1001111100010010101 |
3 | 201202021101201012001121 |
4 | 3000122121033202111 |
5 | 11341104410130221 |
6 | 234524501523541 |
7 | 20632525456405 |
oct | 3003231174225 |
9 | 652241635047 |
10 | 206601255061 |
11 | 7a68a0278a3 |
12 | 3405a4135b1 |
13 | 16636b32b66 |
14 | 9ddcac2805 |
15 | 5592c76a41 |
hex | 301a64f895 |
206601255061 has 6 divisors (see below), whose sum is σ = 213971098562. Its totient is φ = 199477073040.
The previous prime is 206601255031. The next prime is 206601255109. The reversal of 206601255061 is 160552106602.
It can be written as a sum of positive squares in 3 ways, for example, as 47395467025 + 159205788036 = 217705^2 + 399006^2 .
It is not a de Polignac number, because 206601255061 - 223 = 206592866453 is a prime.
It is a super-2 number, since 2×2066012550612 (a number of 23 digits) 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 (206601255031) 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 5 ways as a sum of consecutive naturals, for example, 122829870 + ... + 122831551.
Almost surely, 2206601255061 is an apocalyptic number.
It is an amenable number.
206601255061 is a deficient number, since it is larger than the sum of its proper divisors (7369843501).
206601255061 is an equidigital number, since it uses as much as digits as its factorization.
206601255061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245661479 (or 245661450 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 34.
It can be divided in two parts, 20660 and 1255061, that added together give a palindrome (1275721).
The spelling of 206601255061 in words is "two hundred six billion, six hundred one million, two hundred fifty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •