The number 12481
12481 is a composite number with 4 divisors. Its prime factorisation is 7 × 1783. Divisors (4): 1, 7, 1783, 12481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12481: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 1783, the product of two primes.
- 2
12481 is composite. Its prime factorisation is
- 3
The divisors add up to 14272; without 12481 itself that is 1791, so 12481 is deficient (1791 is less than 12481). Euler's totient φ(12481) = 10692 numbers up to 12481 share no factor with it.
- 4
The digits of 12481 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12481 = 7 \times 1783 \]
12481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14272 |
| Euler totient φ(n) | 10692 |
| Square | 155775361 |
| Cube | 1944232280641 |
| Square root | 111.718396 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.2481 × |
12481 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and eighty-one |
| Binary (base 2) | 11000011000001 |
| Octal (base 8) | 30301 |
| Hexadecimal (base 16) | 30C1 |
| Base 3 | 122010021 |
| As time | 12481 seconds = 3 h 28 min 1 s |
Is 12481 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (12481 ÷ 7 = 1783) | 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 | No (remainder 7) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12481 a prime number?
No. 12481 = 7 × 1783, so it is divisible by 7.
What are the factors of 12481?
1, 7, 1783, 12481.
What is 12481 in binary?
11000011000001 (hexadecimal 30C1, octal 30301).
What is the square root of 12481?
About 111.7184.
Is 12481 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 12481?
12481 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 1783, the product of two primes.