The number 481
481 is a composite number with 4 divisors. Its prime factorisation is 13 × 37. Divisors (4): 1, 13, 37, 481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 481: a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 37, the product of two primes.
- 2
481 is composite. Its prime factorisation is
- 3
The divisors add up to 532; without 481 itself that is 51, so 481 is deficient (51 is less than 481). Euler's totient φ(481) = 432 numbers up to 481 share no factor with it.
- 4
The digits of 481 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 48 steps to reach 1.
LaTeX source of the formulas on this page
\[ 481 = 13 \times 37 \]
481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 532 |
| Euler totient φ(n) | 432 |
| Square | 231361 |
| Cube | 111284641 |
| Square root | 21.931712 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 48 |
| Scientific notation | 4.81 × |
481 in other forms
| Form | Value |
|---|---|
| In words | four hundred and eighty-one |
| Roman numerals | CDLXXXI |
| Binary (base 2) | 111100001 |
| Octal (base 8) | 741 |
| Hexadecimal (base 16) | 1E1 |
| Base 3 | 122211 |
| As time | 481 seconds = 8 min 1 s |
Is 481 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 | No (remainder 5) | 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 4) | 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 8) | 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 481 a prime number?
No. 481 = 13 × 37, so it is divisible by 13.
What are the factors of 481?
1, 13, 37, 481.
What is 481 in binary?
111100001 (hexadecimal 1E1, octal 741).
What is the square root of 481?
About 21.9317.
What is 481 in Roman numerals?
CDLXXXI.
Is 481 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 481?
481 is a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 37, the product of two primes.