Base | Representation |
---|---|
bin | 101110111101001111010111… |
… | …010111101110101101101101 |
3 | 1000002012222102010222021012221 |
4 | 232331033113113232231231 |
5 | 204032044420102100121 |
6 | 2011121145004155341 |
7 | 61333320406454623 |
oct | 5675172727565555 |
9 | 1002188363867187 |
10 | 206518525815661 |
11 | 5a892018994754 |
12 | 1b1b4810538b51 |
13 | 8b307c88c0637 |
14 | 38dd79b219513 |
15 | 18d204a27ab41 |
hex | bbd3d75eeb6d |
206518525815661 has 2 divisors, whose sum is σ = 206518525815662. Its totient is φ = 206518525815660.
The previous prime is 206518525815599. The next prime is 206518525815677. The reversal of 206518525815661 is 166518525815602.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 150261775613161 + 56256750202500 = 12258131^2 + 7500450^2 .
It is a cyclic number.
It is not a de Polignac number, because 206518525815661 - 213 = 206518525807469 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 206518525815661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (206518525816661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 103259262907830 + 103259262907831.
It is an arithmetic number, because the mean of its divisors is an integer number (103259262907831).
Almost surely, 2206518525815661 is an apocalyptic number.
It is an amenable number.
206518525815661 is a deficient number, since it is larger than the sum of its proper divisors (1).
206518525815661 is an equidigital number, since it uses as much as digits as its factorization.
206518525815661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560000, while the sum is 61.
The spelling of 206518525815661 in words is "two hundred six trillion, five hundred eighteen billion, five hundred twenty-five million, eight hundred fifteen thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •