The number 32481
32481 is a composite number with 10 divisors. Its prime factorisation is × 401. Divisors (10): 1, 3, 9, 27, 81, 401, 1203, 3609, 10827, 32481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32481: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
32481 is composite. Its prime factorisation is
- 3
The divisors add up to 48642; without 32481 itself that is 16161, so 32481 is deficient (16161 is less than 32481). Euler's totient φ(32481) = 21600 numbers up to 32481 share no factor with it.
- 4
The digits of 32481 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32481 = 3^{4} \times 401 \]32481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 48642 |
| Euler totient φ(n) | 21600 |
| Square | 1055015361 |
| Cube | 34267953940641 |
| Square root | 180.224860 (= 9√401) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 67 |
| Scientific notation | 3.2481 × |
32481 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand four hundred and eighty-one |
| Binary (base 2) | 111111011100001 |
| Octal (base 8) | 77341 |
| Hexadecimal (base 16) | 7EE1 |
| Base 3 | 1122120000 |
| As time | 32481 seconds = 9 h 1 min 21 s |
Is 32481 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (32481 ÷ 3 = 10827) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (32481 ÷ 9 = 3609) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32481 a prime number?
No. 32481 = × 401, so it is divisible by 3.
What are the factors of 32481?
1, 3, 9, 27, 81, 401, 1203, 3609, 10827, 32481.
What is 32481 in binary?
111111011100001 (hexadecimal 7EE1, octal 77341).
What is the square root of 32481?
About 180.2249, exactly 9√401.
Is 32481 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 32481?
32481 is a happy number: repeatedly adding the squares of its digits reaches 1.