Base | Representation |
---|---|
bin | 1011111111100110001… |
… | …1011110001000000000 |
3 | 201200211222222011111220 |
4 | 2333321203132020000 |
5 | 11333442333210003 |
6 | 234354100435040 |
7 | 20613055356666 |
oct | 2777143361000 |
9 | 650758864456 |
10 | 206050288128 |
11 | 7a42701a223 |
12 | 33b259a8a80 |
13 | 16579944519 |
14 | 9d89860c36 |
15 | 555e6e2353 |
hex | 2ff98de200 |
206050288128 has 320 divisors, whose sum is σ = 602362303488. Its totient is φ = 62309007360.
The previous prime is 206050288061. The next prime is 206050288193. The reversal of 206050288128 is 821882050602.
206050288128 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 206050288128.
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 31 ways as a sum of consecutive naturals, for example, 369928426 + ... + 369928982.
Almost surely, 2206050288128 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 206050288128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (301181151744).
206050288128 is an abundant number, since it is smaller than the sum of its proper divisors (396312015360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206050288128 is a wasteful number, since it uses less digits than its factorization.
206050288128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1083 (or 1067 counting only the distinct ones).
The product of its (nonzero) digits is 122880, while the sum is 42.
The spelling of 206050288128 in words is "two hundred six billion, fifty million, two hundred eighty-eight thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •