Base | Representation |
---|---|
bin | 1011111111111111101… |
… | …1010111100100000000 |
3 | 201201010110011122222110 |
4 | 2333333323113210000 |
5 | 11334202221403000 |
6 | 234412440335320 |
7 | 20615524265031 |
oct | 2777773274400 |
9 | 651113148873 |
10 | 206157216000 |
11 | 7a48141276a |
12 | 33b55774540 |
13 | 16595b42458 |
14 | 9d99b36a88 |
15 | 5568cb4850 |
hex | 2fffed7900 |
206157216000 has 288 divisors, whose sum is σ = 686259100800. Its totient is φ = 54854246400.
The previous prime is 206157215947. The next prime is 206157216019. The reversal of 206157216000 is 612751602.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 48861891 + ... + 48866109.
It is an arithmetic number, because the mean of its divisors is an integer number (2382844100).
Almost surely, 2206157216000 is an apocalyptic number.
206157216000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 206157216000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (343129550400).
206157216000 is an abundant number, since it is smaller than the sum of its proper divisors (480101884800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206157216000 is an equidigital number, since it uses as much as digits as its factorization.
206157216000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4762 (or 4738 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 30.
Adding to 206157216000 its reverse (612751602), we get a palindrome (206769967602).
The spelling of 206157216000 in words is "two hundred six billion, one hundred fifty-seven million, two hundred sixteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •