Base | Representation |
---|---|
bin | 11000011111010… |
… | …10110100001101 |
3 | 112022120010122022 |
4 | 30033222310031 |
5 | 410042343000 |
6 | 32215055525 |
7 | 5043106211 |
oct | 1417526415 |
9 | 468503568 |
10 | 205434125 |
11 | a5a64776 |
12 | 589715a5 |
13 | 3373a870 |
14 | 1d3d8941 |
15 | 1307e585 |
hex | c3ead0d |
205434125 has 16 divisors (see below), whose sum is σ = 276105648. Its totient is φ = 151704000.
The previous prime is 205434109. The next prime is 205434143. The reversal of 205434125 is 521434502.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 75724804 + 129709321 = 8702^2 + 11389^2 .
It is not a de Polignac number, because 205434125 - 24 = 205434109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 205434094 and 205434103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61586 + ... + 64835.
It is an arithmetic number, because the mean of its divisors is an integer number (17256603).
Almost surely, 2205434125 is an apocalyptic number.
205434125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
205434125 is a deficient number, since it is larger than the sum of its proper divisors (70671523).
205434125 is a wasteful number, since it uses less digits than its factorization.
205434125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126449 (or 126439 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 26.
The square root of 205434125 is about 14332.9733481926. The cubic root of 205434125 is about 590.0527818335.
Adding to 205434125 its reverse (521434502), we get a palindrome (726868627).
The spelling of 205434125 in words is "two hundred five million, four hundred thirty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.510 sec. • engine limits •