The number 10481
10481 is a composite number with 4 divisors. Its prime factorisation is 47 × 223. Divisors (4): 1, 47, 223, 10481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10481: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 223, the product of two primes.
- 2
10481 is composite. Its prime factorisation is
- 3
The divisors add up to 10752; without 10481 itself that is 271, so 10481 is deficient (271 is less than 10481). Euler's totient φ(10481) = 10212 numbers up to 10481 share no factor with it.
- 4
The digits of 10481 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10481 = 47 \times 223 \]
10481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 10752 |
| Euler totient φ(n) | 10212 |
| Square | 109851361 |
| Cube | 1151352114641 |
| Square root | 102.376755 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.0481 × |
10481 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and eighty-one |
| Binary (base 2) | 10100011110001 |
| Octal (base 8) | 24361 |
| Hexadecimal (base 16) | 28F1 |
| Base 3 | 112101012 |
| As time | 10481 seconds = 2 h 54 min 41 s |
Is 10481 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 5) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10481 a prime number?
No. 10481 = 47 × 223, so it is divisible by 47.
What are the factors of 10481?
1, 47, 223, 10481.
What is 10481 in binary?
10100011110001 (hexadecimal 28F1, octal 24361).
What is the square root of 10481?
About 102.3768.
Is 10481 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 10481?
10481 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 223, the product of two primes.