Base | Representation |
---|---|
bin | 11000110101111… |
… | …01001111000000 |
3 | 112112010110122220 |
4 | 30122331033000 |
5 | 411322040102 |
6 | 32402331040 |
7 | 5110212132 |
oct | 1432751700 |
9 | 475113586 |
10 | 208393152 |
11 | a76a5950 |
12 | 59959a80 |
13 | 34235676 |
14 | 1d969052 |
15 | 134661bc |
hex | c6bd3c0 |
208393152 has 112 divisors (see below), whose sum is σ = 609600000. Its totient is φ = 62300160.
The previous prime is 208393147. The next prime is 208393169. The reversal of 208393152 is 251393802.
208393152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 166224 + ... + 167472.
Almost surely, 2208393152 is an apocalyptic number.
208393152 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 208393152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (304800000).
208393152 is an abundant number, since it is smaller than the sum of its proper divisors (401206848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
208393152 is a wasteful number, since it uses less digits than its factorization.
208393152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1354 (or 1344 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 208393152 is about 14435.8287604141. The cubic root of 208393152 is about 592.8722836161.
The spelling of 208393152 in words is "two hundred eight million, three hundred ninety-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.718 sec. • engine limits •