The number 15301
15301 is a composite number with 8 divisors. Its prime factorisation is 11 × 13 × 107. Divisors (8): 1, 11, 13, 107, 143, 1177, 1391, 15301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15301 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15301 is composite. Its prime factorisation is
- 3
The divisors add up to 18144; without 15301 itself that is 2843, so 15301 is deficient (2843 is less than 15301). Euler's totient φ(15301) = 12720 numbers up to 15301 share no factor with it.
- 4
The digits of 15301 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15301 = 11 \times 13 \times 107 \]
15301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18144 |
| Euler totient φ(n) | 12720 |
| Square | 234120601 |
| Cube | 3582279315901 |
| Square root | 123.697211 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5301 × |
15301 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and one |
| Binary (base 2) | 11101111000101 |
| Octal (base 8) | 35705 |
| Hexadecimal (base 16) | 3BC5 |
| Base 3 | 202222201 |
| As time | 15301 seconds = 4 h 15 min 1 s |
Is 15301 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 6) | 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 5) | 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 | Yes (15301 ÷ 11 = 1391) | 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 15301 a prime number?
No. 15301 = 11 × 13 × 107, so it is divisible by 11.
What are the factors of 15301?
1, 11, 13, 107, 143, 1177, 1391, 15301.
What is 15301 in binary?
11101111000101 (hexadecimal 3BC5, octal 35705).
What is the square root of 15301?
About 123.6972.
Is 15301 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 15301?
It is a composite number with 8 divisors.