The number 3481
3481 is a perfect square (59²). Its prime factorisation is . Divisors (3): 1, 59, 3481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3481: a perfect square (59²); the square of a prime (59²).
- 2
3481 is composite. Its prime factorisation is
- 3
The divisors add up to 3541; without 3481 itself that is 60, so 3481 is deficient (60 is less than 3481). Euler's totient φ(3481) = 3422 numbers up to 3481 share no factor with it.
- 4
The digits of 3481 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 56 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3481 = 59^{2} \]3481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 3 |
| Sum of divisors | 3541 |
| Euler totient φ(n) | 3422 |
| Square | 12117361 |
| Cube | 42180533641 |
| Square root | 59 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 56 |
| Scientific notation | 3.481 × |
| Perfect power |
3481 in other forms
| Form | Value |
|---|---|
| In words | three thousand four hundred and eighty-one |
| Roman numerals | MMMCDLXXXI |
| Binary (base 2) | 110110011001 |
| Octal (base 8) | 6631 |
| Hexadecimal (base 16) | D99 |
| Base 3 | 11202221 |
| As time | 3481 seconds = 58 min 1 s |
Is 3481 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 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 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 5) | 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 3481 a prime number?
No. 3481 = , so it is divisible by 59.
What are the factors of 3481?
1, 59, 3481.
What is 3481 in binary?
110110011001 (hexadecimal D99, octal 6631).
What is the square root of 3481?
59, because 59 × 59 = 3481.
What is 3481 in Roman numerals?
MMMCDLXXXI.
Is 3481 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 3481?
3481 is a perfect square (59²); the square of a prime (59²).