Base | Representation |
---|---|
bin | 10011011001110… |
… | …101110010110101 |
3 | 211200120012100202 |
4 | 103121311302311 |
5 | 1131314303140 |
6 | 52145250245 |
7 | 11032024154 |
oct | 2331656265 |
9 | 750505322 |
10 | 325541045 |
11 | 157839895 |
12 | 91033985 |
13 | 525a134b |
14 | 3134159b |
15 | 1d8a6915 |
hex | 13675cb5 |
325541045 has 4 divisors (see below), whose sum is σ = 390649260. Its totient is φ = 260432832.
The previous prime is 325541039. The next prime is 325541081. The reversal of 325541045 is 540145523.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 168013444 + 157527601 = 12962^2 + 12551^2 .
It is a cyclic number.
It is not a de Polignac number, because 325541045 - 26 = 325540981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 325540999 and 325541017.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32554100 + ... + 32554109.
It is an arithmetic number, because the mean of its divisors is an integer number (97662315).
Almost surely, 2325541045 is an apocalyptic number.
It is an amenable number.
325541045 is a deficient number, since it is larger than the sum of its proper divisors (65108215).
325541045 is an equidigital number, since it uses as much as digits as its factorization.
325541045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65108214.
The product of its (nonzero) digits is 12000, while the sum is 29.
The square root of 325541045 is about 18042.7560256187. The cubic root of 325541045 is about 687.9157472150.
Adding to 325541045 its reverse (540145523), we get a palindrome (865686568).
The spelling of 325541045 in words is "three hundred twenty-five million, five hundred forty-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.071 sec. • engine limits •