Base | Representation |
---|---|
bin | 11000011110101… |
… | …10010011101101 |
3 | 112022101212102012 |
4 | 30033112103231 |
5 | 410032201000 |
6 | 32213211005 |
7 | 5042306261 |
oct | 1417262355 |
9 | 468355365 |
10 | 205350125 |
11 | a5a07652 |
12 | 58930a65 |
13 | 3370b566 |
14 | 1d3b60a1 |
15 | 13064735 |
hex | c3d64ed |
205350125 has 8 divisors (see below), whose sum is σ = 256277112. Its totient is φ = 164280000.
The previous prime is 205350091. The next prime is 205350127. The reversal of 205350125 is 521053502.
It can be written as a sum of positive squares in 4 ways, for example, as 16370116 + 188980009 = 4046^2 + 13747^2 .
It is not a de Polignac number, because 205350125 - 210 = 205349101 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 205350125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (205350127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 821276 + ... + 821525.
It is an arithmetic number, because the mean of its divisors is an integer number (32034639).
Almost surely, 2205350125 is an apocalyptic number.
205350125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
205350125 is a deficient number, since it is larger than the sum of its proper divisors (50926987).
205350125 is an equidigital number, since it uses as much as digits as its factorization.
205350125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1642816 (or 1642806 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 23.
The square root of 205350125 is about 14330.0427424345. The cubic root of 205350125 is about 589.9723486035.
The spelling of 205350125 in words is "two hundred five million, three hundred fifty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •