Base | Representation |
---|---|
bin | 11000110111101… |
… | …10110101010000 |
3 | 112112120110021200 |
4 | 30123312311100 |
5 | 411402112242 |
6 | 32411351200 |
7 | 5112214011 |
oct | 1433666520 |
9 | 475513250 |
10 | 208629072 |
11 | a7847123 |
12 | 59a52500 |
13 | 342b8b72 |
14 | 1d9cb008 |
15 | 134b104c |
hex | c6f6d50 |
208629072 has 60 divisors (see below), whose sum is σ = 585489684. Its totient is φ = 69350400.
The previous prime is 208629061. The next prime is 208629073. The reversal of 208629072 is 270926802.
208629072 is a `hidden beast` number, since 20 + 8 + 629 + 0 + 7 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 96353856 + 112275216 = 9816^2 + 10596^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (208629073) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 55938 + ... + 59550.
Almost surely, 2208629072 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 208629072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (292744842).
208629072 is an abundant number, since it is smaller than the sum of its proper divisors (376860612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
208629072 is a wasteful number, since it uses less digits than its factorization.
208629072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4028 (or 4019 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 208629072 is about 14443.9977845470. The cubic root of 208629072 is about 593.0959276898.
The spelling of 208629072 in words is "two hundred eight million, six hundred twenty-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •