Base | Representation |
---|---|
bin | 11000110110101… |
… | …00000111011000 |
3 | 112112022020020000 |
4 | 30123110013120 |
5 | 411333034442 |
6 | 32404333000 |
7 | 5111052306 |
oct | 1433240730 |
9 | 475266200 |
10 | 208486872 |
11 | a775a300 |
12 | 599a4160 |
13 | 34269219 |
14 | 1d991276 |
15 | 13483d4c |
hex | c6d41d8 |
208486872 has 120 divisors (see below), whose sum is σ = 642110700. Its totient is φ = 63154080.
The previous prime is 208486871. The next prime is 208486891. The reversal of 208486872 is 278684802.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (208486871) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 77079 + ... + 79737.
Almost surely, 2208486872 is an apocalyptic number.
208486872 is a gapful number since it is divisible by the number (22) 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 208486872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (321055350).
208486872 is an abundant number, since it is smaller than the sum of its proper divisors (433623828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
208486872 is a wasteful number, since it uses less digits than its factorization.
208486872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2699 (or 2675 counting only the distinct ones).
The product of its (nonzero) digits is 344064, while the sum is 45.
The square root of 208486872 is about 14439.0744855756. The cubic root of 208486872 is about 592.9611471615.
The spelling of 208486872 in words is "two hundred eight million, four hundred eighty-six thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •