Base | Representation |
---|---|
bin | 1100001001000111100… |
… | …0101111010001010000 |
3 | 201221110002222210101212 |
4 | 3002101320233101100 |
5 | 11404211114001313 |
6 | 235455434315252 |
7 | 21033310513424 |
oct | 3022170572120 |
9 | 657402883355 |
10 | 208606000208 |
11 | 80518715571 |
12 | 34519888b28 |
13 | 1689627bca8 |
14 | a14d054b84 |
15 | 565dc753a8 |
hex | 3091e2f450 |
208606000208 has 80 divisors (see below), whose sum is σ = 436660087680. Its totient is φ = 96246087168.
The previous prime is 208606000201. The next prime is 208606000289. The reversal of 208606000208 is 802000606802.
It is a happy number.
It is a super-3 number, since 3×2086060002083 (a number of 35 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (208606000201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13620491 + ... + 13635797.
It is an arithmetic number, because the mean of its divisors is an integer number (5458251096).
Almost surely, 2208606000208 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 208606000208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (218330043840).
208606000208 is an abundant number, since it is smaller than the sum of its proper divisors (228054087472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
208606000208 is a wasteful number, since it uses less digits than its factorization.
208606000208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16644 (or 16638 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 32.
The spelling of 208606000208 in words is "two hundred eight billion, six hundred six million, two hundred eight", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •