Base | Representation |
---|---|
bin | 11000110100010… |
… | …01111110111110 |
3 | 112111201210201000 |
4 | 30122021332332 |
5 | 411243330410 |
6 | 32354031130 |
7 | 5105346123 |
oct | 1432117676 |
9 | 474653630 |
10 | 208183230 |
11 | a7572162 |
12 | 598784a6 |
13 | 34190c58 |
14 | 1d91274a |
15 | 13423dc0 |
hex | c689fbe |
208183230 has 32 divisors (see below), whose sum is σ = 555156000. Its totient is φ = 55515456.
The previous prime is 208183229. The next prime is 208183231. The reversal of 208183230 is 32381802.
It is an interprime number because it is at equal distance from previous prime (208183229) and next prime (208183231).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 208183194 and 208183203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (208183231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 385255 + ... + 385794.
It is an arithmetic number, because the mean of its divisors is an integer number (17348625).
Almost surely, 2208183230 is an apocalyptic number.
208183230 is an abundant number, since it is smaller than the sum of its proper divisors (346972770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
208183230 is a wasteful number, since it uses less digits than its factorization.
208183230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 771065 (or 771059 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 208183230 is about 14428.5560608122. The cubic root of 208183230 is about 592.6731427971.
The spelling of 208183230 in words is "two hundred eight million, one hundred eighty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •