Base | Representation |
---|---|
bin | 111101011101… |
… | …1110000010101 |
3 | 2020122021012121 |
4 | 1322323300111 |
5 | 31222220300 |
6 | 3110415541 |
7 | 540630205 |
oct | 172736025 |
9 | 66567177 |
10 | 32226325 |
11 | 1721112a |
12 | a9615b1 |
13 | 68a4441 |
14 | 43cc405 |
15 | 2c6881a |
hex | 1ebbc15 |
32226325 has 6 divisors (see below), whose sum is σ = 39960674. Its totient is φ = 25781040.
The previous prime is 32226323. The next prime is 32226343. The reversal of 32226325 is 52362223.
It can be written as a sum of positive squares in 3 ways, for example, as 224676 + 32001649 = 474^2 + 5657^2 .
It is not a de Polignac number, because 32226325 - 21 = 32226323 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25), and also a Moran number because the ratio is a prime number: 1289053 = 32226325 / (3 + 2 + 2 + 2 + 6 + 3 + 2 + 5).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 32226325.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32226323) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 644502 + ... + 644551.
Almost surely, 232226325 is an apocalyptic number.
It is an amenable number.
32226325 is a deficient number, since it is larger than the sum of its proper divisors (7734349).
32226325 is a wasteful number, since it uses less digits than its factorization.
32226325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1289063 (or 1289058 counting only the distinct ones).
The product of its digits is 4320, while the sum is 25.
The square root of 32226325 is about 5676.8234955827. The cubic root of 32226325 is about 318.2269288545.
Adding to 32226325 its reverse (52362223), we get a palindrome (84588548).
The spelling of 32226325 in words is "thirty-two million, two hundred twenty-six thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •