The number 15481
15481 is a composite number with 4 divisors. Its prime factorisation is 113 × 137. Divisors (4): 1, 113, 137, 15481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15481: a semiprime: 113 × 137, the product of two primes.
- 2
15481 is composite. Its prime factorisation is
- 3
The divisors add up to 15732; without 15481 itself that is 251, so 15481 is deficient (251 is less than 15481). Euler's totient φ(15481) = 15232 numbers up to 15481 share no factor with it.
- 4
The digits of 15481 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15481 = 113 \times 137 \]
15481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15732 |
| Euler totient φ(n) | 15232 |
| Square | 239661361 |
| Cube | 3710197529641 |
| Square root | 124.422667 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5481 × |
15481 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and eighty-one |
| Binary (base 2) | 11110001111001 |
| Octal (base 8) | 36171 |
| Hexadecimal (base 16) | 3C79 |
| Base 3 | 210020101 |
| As time | 15481 seconds = 4 h 18 min 1 s |
Is 15481 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 4) | 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 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15481 a prime number?
No. 15481 = 113 × 137, so it is divisible by 113.
What are the factors of 15481?
1, 113, 137, 15481.
What is 15481 in binary?
11110001111001 (hexadecimal 3C79, octal 36171).
What is the square root of 15481?
About 124.4227.
Is 15481 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 15481?
15481 is a semiprime: 113 × 137, the product of two primes.