Base | Representation |
---|---|
bin | 11000100001011… |
… | …01101001111100 |
3 | 112100002001012010 |
4 | 30100231221330 |
5 | 410130123100 |
6 | 32225011220 |
7 | 5045326326 |
oct | 1420555174 |
9 | 470061163 |
10 | 205707900 |
11 | a6131432 |
12 | 58a83b10 |
13 | 33805368 |
14 | 1d46a616 |
15 | 130d5750 |
hex | c42da7c |
205707900 has 72 divisors (see below), whose sum is σ = 601402480. Its totient is φ = 54282240.
The previous prime is 205707877. The next prime is 205707959. The reversal of 205707900 is 9707502.
It is a happy number.
205707900 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 (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25566 + ... + 32634.
Almost surely, 2205707900 is an apocalyptic number.
205707900 is a gapful number since it is divisible by the number (20) 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 205707900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (300701240).
205707900 is an abundant number, since it is smaller than the sum of its proper divisors (395694580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
205707900 is a wasteful number, since it uses less digits than its factorization.
205707900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7183 (or 7176 counting only the distinct ones).
The product of its (nonzero) digits is 4410, while the sum is 30.
The square root of 205707900 is about 14342.5206989567. The cubic root of 205707900 is about 590.3147798391.
The spelling of 205707900 in words is "two hundred five million, seven hundred seven thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •