Base | Representation |
---|---|
bin | 11001000011001… |
… | …01010110010101 |
3 | 112122101201121122 |
4 | 30201211112111 |
5 | 412243132300 |
6 | 32503453325 |
7 | 5131035566 |
oct | 1441452625 |
9 | 478351548 |
10 | 210130325 |
11 | a8682029 |
12 | 5a457245 |
13 | 346c3292 |
14 | 1dc9c16d |
15 | 136aac85 |
hex | c865595 |
210130325 has 12 divisors (see below), whose sum is σ = 260744100. Its totient is φ = 167986560.
The previous prime is 210130303. The next prime is 210130337. The reversal of 210130325 is 523031012.
It can be written as a sum of positive squares in 6 ways, for example, as 10699441 + 199430884 = 3271^2 + 14122^2 .
It is not a de Polignac number, because 210130325 - 210 = 210129301 is a prime.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 59201 + ... + 62649.
It is an arithmetic number, because the mean of its divisors is an integer number (21728675).
Almost surely, 2210130325 is an apocalyptic number.
210130325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
210130325 is a deficient number, since it is larger than the sum of its proper divisors (50613775).
210130325 is a wasteful number, since it uses less digits than its factorization.
210130325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5896 (or 5891 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 210130325 is about 14495.8726884586. The cubic root of 210130325 is about 594.5151288378.
Adding to 210130325 its reverse (523031012), we get a palindrome (733161337).
The spelling of 210130325 in words is "two hundred ten million, one hundred thirty thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •