Base | Representation |
---|---|
bin | 1100000000101110011… |
… | …0011100000101111001 |
3 | 201201122002200101010021 |
4 | 3000023212130011321 |
5 | 11340102340243441 |
6 | 234444114050441 |
7 | 20623423015342 |
oct | 3001346340571 |
9 | 651562611107 |
10 | 206353056121 |
11 | 7a571a14303 |
12 | 33bab279a21 |
13 | 165c75a1194 |
14 | 9db7b550c9 |
15 | 557b09b3d1 |
hex | 300b99c179 |
206353056121 has 9 divisors (see below), whose sum is σ = 207150622861. Its totient is φ = 205558553632.
The previous prime is 206353056113. The next prime is 206353056131. The reversal of 206353056121 is 121650353602.
The square root of 206353056121 is 454261.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 7133660521 + 199219395600 = 84461^2 + 446340^2 .
It is not a de Polignac number, because 206353056121 - 23 = 206353056113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (206353056101) 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 8 ways as a sum of consecutive naturals, for example, 144000021 + ... + 144001453.
Almost surely, 2206353056121 is an apocalyptic number.
206353056121 is the 454261-st square number.
206353056121 is the 227131-st centered octagonal number.
It is an amenable number.
206353056121 is a deficient number, since it is larger than the sum of its proper divisors (797566740).
206353056121 is an frugal number, since it uses more digits than its factorization.
206353056121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3500 (or 1750 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 34.
The spelling of 206353056121 in words is "two hundred six billion, three hundred fifty-three million, fifty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •