Base | Representation |
---|---|
bin | 11000011111110… |
… | …11000100000000 |
3 | 112022200111221000 |
4 | 30033323010000 |
5 | 410102010142 |
6 | 32220332000 |
7 | 5043504216 |
oct | 1417730400 |
9 | 468614830 |
10 | 205500672 |
11 | a5aaa773 |
12 | 589a4000 |
13 | 33761c40 |
14 | 1d414cb6 |
15 | 1309414c |
hex | c3fb100 |
205500672 has 144 divisors (see below), whose sum is σ = 654734080. Its totient is φ = 63203328.
The previous prime is 205500671. The next prime is 205500679. The reversal of 205500672 is 276005502.
205500672 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (205500671) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 88713 + ... + 90999.
Almost surely, 2205500672 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 205500672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (327367040).
205500672 is an abundant number, since it is smaller than the sum of its proper divisors (449233408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
205500672 is a wasteful number, since it uses less digits than its factorization.
205500672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2325 (or 2305 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 205500672 is about 14335.2946255039. The cubic root of 205500672 is about 590.1164875808.
The spelling of 205500672 in words is "two hundred five million, five hundred thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •