Base | Representation |
---|---|
bin | 10011011001111… |
… | …000000000101101 |
3 | 211200120122211001 |
4 | 103121320000231 |
5 | 1131320101000 |
6 | 52145400301 |
7 | 11032062505 |
oct | 2331700055 |
9 | 750518731 |
10 | 325550125 |
11 | 15784569a |
12 | 91039091 |
13 | 525a5514 |
14 | 31344a05 |
15 | 1d8a946a |
hex | 1367802d |
325550125 has 8 divisors (see below), whose sum is σ = 406286712. Its totient is φ = 260440000.
The previous prime is 325550117. The next prime is 325550129. The reversal of 325550125 is 521055523.
It can be written as a sum of positive squares in 4 ways, for example, as 32558436 + 292991689 = 5706^2 + 17117^2 .
It is not a de Polignac number, because 325550125 - 23 = 325550117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 325550093 and 325550102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (325550129) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1302076 + ... + 1302325.
It is an arithmetic number, because the mean of its divisors is an integer number (50785839).
Almost surely, 2325550125 is an apocalyptic number.
It is an amenable number.
325550125 is a deficient number, since it is larger than the sum of its proper divisors (80736587).
325550125 is an equidigital number, since it uses as much as digits as its factorization.
325550125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2604416 (or 2604406 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 28.
The square root of 325550125 is about 18043.0076483939. The cubic root of 325550125 is about 687.9221429440.
The spelling of 325550125 in words is "three hundred twenty-five million, five hundred fifty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •