The number 4481
4481 is a twin prime (4481 and 4483 are both prime) and the 608th prime number. Its only divisors are 1 and 4481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4481: a twin prime (4481 and 4483 are both prime); the 608th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
4481 is prime, so its only factors are 1 and 4481. It is the 608th prime; the next prime is 4483 and the one before is 4463.
- 3
The divisors add up to 4482; without 4481 itself that is 1, so 4481 is deficient (1 is less than 4481). Euler's totient φ(4481) = 4480 numbers up to 4481 share no factor with it.
- 4
The digits of 4481 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 46 steps to reach 1.
4481 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 4482 |
| Euler totient φ(n) | 4480 |
| Square | 20079361 |
| Cube | 89975616641 |
| Square root | 66.940272 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 46 |
| Scientific notation | 4.481 × |
4481 in other forms
| Form | Value |
|---|---|
| In words | four thousand four hundred and eighty-one |
| Binary (base 2) | 1000110000001 |
| Octal (base 8) | 10601 |
| Hexadecimal (base 16) | 1181 |
| Base 3 | 20010222 |
| As time | 4481 seconds = 1 h 14 min 41 s |
Is 4481 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 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 | No (remainder 8) | 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 4) | 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 4481 a prime number?
Yes. 4481 is divisible only by 1 and itself.
What are the factors of 4481?
1, 4481.
What is 4481 in binary?
1000110000001 (hexadecimal 1181, octal 10601).
What is the square root of 4481?
About 66.9403.
Is 4481 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 4481?
4481 is a twin prime (4481 and 4483 are both prime); the 608th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.