Base | Representation |
---|---|
bin | 11000011100010… |
… | …11000111001101 |
3 | 112021211012220210 |
4 | 30032023013031 |
5 | 404442322000 |
6 | 32202433033 |
7 | 5036554311 |
oct | 1416130715 |
9 | 467735823 |
10 | 205042125 |
11 | a5817202 |
12 | 58802779 |
13 | 33631302 |
14 | 1d335b41 |
15 | 13003350 |
hex | c38b1cd |
205042125 has 32 divisors (see below), whose sum is σ = 356039424. Its totient is φ = 104596800.
The previous prime is 205042111. The next prime is 205042139. The reversal of 205042125 is 521240502.
It is a happy number.
205042125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (205042111) and next prime (205042139).
It is not a de Polignac number, because 205042125 - 220 = 203993549 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3262 + ... + 20511.
It is an arithmetic number, because the mean of its divisors is an integer number (11126232).
Almost surely, 2205042125 is an apocalyptic number.
205042125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
205042125 is a deficient number, since it is larger than the sum of its proper divisors (150997299).
205042125 is a wasteful number, since it uses less digits than its factorization.
205042125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23814 (or 23804 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 21.
The square root of 205042125 is about 14319.2920565229. The cubic root of 205042125 is about 589.6772389586.
Adding to 205042125 its reverse (521240502), we get a palindrome (726282627).
The spelling of 205042125 in words is "two hundred five million, forty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •