The number 15265
15265 is a composite number with 8 divisors. Its prime factorisation is 5 × 43 × 71. Divisors (8): 1, 5, 43, 71, 215, 355, 3053, 15265.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15265: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15265 is composite. Its prime factorisation is
- 3
The divisors add up to 19008; without 15265 itself that is 3743, so 15265 is deficient (3743 is less than 15265). Euler's totient φ(15265) = 11760 numbers up to 15265 share no factor with it.
- 4
The digits of 15265 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15265 = 5 \times 43 \times 71 \]
15265 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19008 |
| Euler totient φ(n) | 11760 |
| Square | 233020225 |
| Cube | 3557053734625 |
| Square root | 123.551609 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5265 × |
15265 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and sixty-five |
| Binary (base 2) | 11101110100001 |
| Octal (base 8) | 35641 |
| Hexadecimal (base 16) | 3BA1 |
| Base 3 | 202221101 |
| As time | 15265 seconds = 4 h 14 min 25 s |
Is 15265 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 | Yes (15265 ÷ 5 = 3053) | 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 5) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 15265 a prime number?
No. 15265 = 5 × 43 × 71, so it is divisible by 5.
What are the factors of 15265?
1, 5, 43, 71, 215, 355, 3053, 15265.
What is 15265 in binary?
11101110100001 (hexadecimal 3BA1, octal 35641).
What is the square root of 15265?
About 123.5516.
Is 15265 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 15265?
15265 is a happy number: repeatedly adding the squares of its digits reaches 1.