Base | Representation |
---|---|
bin | 1100000001101100011… |
… | …0000100000101100010 |
3 | 201202022012211010110021 |
4 | 3000123012010011202 |
5 | 11341120412122032 |
6 | 234530001424054 |
7 | 20633030363632 |
oct | 3003306040542 |
9 | 652265733407 |
10 | 206613004642 |
11 | 7a6957224a0 |
12 | 3406233b02a |
13 | 166393b7b85 |
14 | a0004a06c2 |
15 | 5593ce8097 |
hex | 301b184162 |
206613004642 has 8 divisors (see below), whose sum is σ = 338094007632. Its totient is φ = 93915002100.
The previous prime is 206613004639. The next prime is 206613004651. The reversal of 206613004642 is 246400316602.
206613004642 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2066130046422 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 206613004598 and 206613004607.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4695750084 + ... + 4695750127.
It is an arithmetic number, because the mean of its divisors is an integer number (42261750954).
Almost surely, 2206613004642 is an apocalyptic number.
206613004642 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
206613004642 is a deficient number, since it is larger than the sum of its proper divisors (131481002990).
206613004642 is a wasteful number, since it uses less digits than its factorization.
206613004642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9391500224.
The product of its (nonzero) digits is 41472, while the sum is 34.
The spelling of 206613004642 in words is "two hundred six billion, six hundred thirteen million, four thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •