Base | Representation |
---|---|
bin | 10011011001010… |
… | …110100100000101 |
3 | 211200022200212222 |
4 | 103121112210011 |
5 | 1131301210000 |
6 | 52142422125 |
7 | 11030652212 |
oct | 2331264405 |
9 | 750280788 |
10 | 325413125 |
11 | 157761774 |
12 | 90b91945 |
13 | 5255805b |
14 | 3130ab09 |
15 | 1d87da85 |
hex | 13656905 |
325413125 has 20 divisors (see below), whose sum is σ = 408253692. Its totient is φ = 259296000.
The previous prime is 325413097. The next prime is 325413191. The reversal of 325413125 is 521314523.
It is a happy number.
It can be written as a sum of positive squares in 10 ways, for example, as 164275489 + 161137636 = 12817^2 + 12694^2 .
It is not a de Polignac number, because 325413125 - 28 = 325412869 is a prime.
It is a super-3 number, since 3×3254131253 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 325413094 and 325413103.
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 19 ways as a sum of consecutive naturals, for example, 182237 + ... + 184013.
Almost surely, 2325413125 is an apocalyptic number.
It is an amenable number.
325413125 is a deficient number, since it is larger than the sum of its proper divisors (82840567).
325413125 is an equidigital number, since it uses as much as digits as its factorization.
325413125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2090 (or 2075 counting only the distinct ones).
The product of its digits is 3600, while the sum is 26.
The square root of 325413125 is about 18039.2107643322. The cubic root of 325413125 is about 687.8256308662.
Adding to 325413125 its reverse (521314523), we get a palindrome (846727648).
The spelling of 325413125 in words is "three hundred twenty-five million, four hundred thirteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •