Base | Representation |
---|---|
bin | 11000100111011… |
… | …01001110000110 |
3 | 112101112220112020 |
4 | 30103231032012 |
5 | 410330230200 |
6 | 32253504010 |
7 | 5055105045 |
oct | 1423551606 |
9 | 471486466 |
10 | 206492550 |
11 | a6617a00 |
12 | 591a2006 |
13 | 33a1b554 |
14 | 1d5d255c |
15 | 131dcea0 |
hex | c4ed386 |
206492550 has 144 divisors (see below), whose sum is σ = 582629376. Its totient is φ = 48312000.
The previous prime is 206492537. The next prime is 206492567. The reversal of 206492550 is 55294602.
206492550 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 Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 562467 + ... + 562833.
Almost surely, 2206492550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 206492550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (291314688).
206492550 is an abundant number, since it is smaller than the sum of its proper divisors (376136826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206492550 is a wasteful number, since it uses less digits than its factorization.
With its predecessor (206492549) it forms a Ruth-Aaron pair, since the sum of their distinct prime factors is the same (419).
206492550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 435 (or 419 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 206492550 is about 14369.8486422091. The cubic root of 206492550 is about 591.0643909904.
The spelling of 206492550 in words is "two hundred six million, four hundred ninety-two thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •