Base | Representation |
---|---|
bin | 1100000000001110110… |
… | …0011101010010001100 |
3 | 201201021212002120021101 |
4 | 3000003230131102030 |
5 | 11334314411304030 |
6 | 234423015112444 |
7 | 20620222421014 |
oct | 3000354352214 |
9 | 651255076241 |
10 | 206220416140 |
11 | 7a504059992 |
12 | 33b72972724 |
13 | 165a5c6cb9b |
14 | 9da42a8c44 |
15 | 556e5ea7ca |
hex | 3003b1d48c |
206220416140 has 12 divisors (see below), whose sum is σ = 433062873936. Its totient is φ = 82488166448.
The previous prime is 206220416137. The next prime is 206220416161. The reversal of 206220416140 is 41614022602.
206220416140 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 206220416099 and 206220416108.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5155510384 + ... + 5155510423.
It is an arithmetic number, because the mean of its divisors is an integer number (36088572828).
Almost surely, 2206220416140 is an apocalyptic number.
206220416140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
206220416140 is an abundant number, since it is smaller than the sum of its proper divisors (226842457796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206220416140 is a wasteful number, since it uses less digits than its factorization.
206220416140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10311020816 (or 10311020814 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 206220416140 its reverse (41614022602), we get a palindrome (247834438742).
The spelling of 206220416140 in words is "two hundred six billion, two hundred twenty million, four hundred sixteen thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.864 sec. • engine limits •