Base | Representation |
---|---|
bin | 1100001001010010010… |
… | …1101010110000101000 |
3 | 201221120021021220211010 |
4 | 3002110211222300220 |
5 | 11404304220121043 |
6 | 235504134103520 |
7 | 21034401031113 |
oct | 3022445526050 |
9 | 657507256733 |
10 | 208651332648 |
11 | 805412684a0 |
12 | 34530aaaba0 |
13 | 168a2791a15 |
14 | a15509557a |
15 | 5662c2c133 |
hex | 309496ac28 |
208651332648 has 32 divisors (see below), whose sum is σ = 569049089760. Its totient is φ = 63227676480.
The previous prime is 208651332647. The next prime is 208651332649. The reversal of 208651332648 is 846233156802.
It is an interprime number because it is at equal distance from previous prime (208651332647) and next prime (208651332649).
It is a super-3 number, since 3×2086513326483 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 208651332597 and 208651332606.
It is not an unprimeable number, because it can be changed into a prime (208651332647) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 395172715 + ... + 395173242.
It is an arithmetic number, because the mean of its divisors is an integer number (17782784055).
Almost surely, 2208651332648 is an apocalyptic number.
It is an amenable number.
208651332648 is an abundant number, since it is smaller than the sum of its proper divisors (360397757112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
208651332648 is a wasteful number, since it uses less digits than its factorization.
208651332648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 790345977 (or 790345973 counting only the distinct ones).
The product of its (nonzero) digits is 1658880, while the sum is 48.
The spelling of 208651332648 in words is "two hundred eight billion, six hundred fifty-one million, three hundred thirty-two thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •