The number 15201
15201 is a composite number with 8 divisors. Its prime factorisation is × 563. Divisors (8): 1, 3, 9, 27, 563, 1689, 5067, 15201.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15201: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
15201 is composite. Its prime factorisation is
- 3
The divisors add up to 22560; without 15201 itself that is 7359, so 15201 is deficient (7359 is less than 15201). Euler's totient φ(15201) = 10116 numbers up to 15201 share no factor with it.
- 4
The digits of 15201 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15201 = 3^{3} \times 563 \]15201 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22560 |
| Euler totient φ(n) | 10116 |
| Square | 231070401 |
| Cube | 3512501165601 |
| Square root | 123.292336 (= 3√1689) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5201 × |
15201 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and one |
| Binary (base 2) | 11101101100001 |
| Octal (base 8) | 35541 |
| Hexadecimal (base 16) | 3B61 |
| Base 3 | 202212000 |
| As time | 15201 seconds = 4 h 13 min 21 s |
Is 15201 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 | Yes (15201 ÷ 3 = 5067) | 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 3) | 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 | Yes (15201 ÷ 9 = 1689) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15201 a prime number?
No. 15201 = × 563, so it is divisible by 3.
What are the factors of 15201?
1, 3, 9, 27, 563, 1689, 5067, 15201.
What is 15201 in binary?
11101101100001 (hexadecimal 3B61, octal 35541).
What is the square root of 15201?
About 123.2923, exactly 3√1689.
Is 15201 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 15201?
15201 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.