Base | Representation |
---|---|
bin | 1100000010011110000… |
… | …1011010111011110001 |
3 | 201202211202010221000202 |
4 | 3000213201122323301 |
5 | 11342032301041310 |
6 | 235002410324545 |
7 | 20641141523666 |
oct | 3004741327361 |
9 | 652752127022 |
10 | 206821502705 |
11 | 7a79238a144 |
12 | 34100129755 |
13 | 166706591cc |
14 | a020055a6d |
15 | 55a72803a5 |
hex | 302785aef1 |
206821502705 has 8 divisors (see below), whose sum is σ = 250382138472. Its totient is φ = 163992978688.
The previous prime is 206821502677. The next prime is 206821502803. The reversal of 206821502705 is 507205128602.
206821502705 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 23129543056 + 183691959649 = 152084^2 + 428593^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-206821502705 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 183027314 + ... + 183028443.
It is an arithmetic number, because the mean of its divisors is an integer number (31297767309).
Almost surely, 2206821502705 is an apocalyptic number.
It is an amenable number.
206821502705 is a deficient number, since it is larger than the sum of its proper divisors (43560635767).
206821502705 is a wasteful number, since it uses less digits than its factorization.
206821502705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366055875.
The product of its (nonzero) digits is 67200, while the sum is 38.
The spelling of 206821502705 in words is "two hundred six billion, eight hundred twenty-one million, five hundred two thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •