The number 15057
15057 is a composite number with 12 divisors. Its prime factorisation is × 7 × 239. Divisors (12): 1, 3, 7, 9, 21, 63, 239, 717, 1673, 2151, 5019, 15057.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15057: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15057 is composite. Its prime factorisation is
- 3
The divisors add up to 24960; without 15057 itself that is 9903, so 15057 is deficient (9903 is less than 15057). Euler's totient φ(15057) = 8568 numbers up to 15057 share no factor with it.
- 4
The digits of 15057 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15057 = 3^{2} \times 7 \times 239 \]15057 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 24960 |
| Euler totient φ(n) | 8568 |
| Square | 226713249 |
| Cube | 3413621390193 |
| Square root | 122.706968 (= 3√1673) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.5057 × |
15057 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and fifty-seven |
| Binary (base 2) | 11101011010001 |
| Octal (base 8) | 35321 |
| Hexadecimal (base 16) | 3AD1 |
| Base 3 | 202122200 |
| As time | 15057 seconds = 4 h 10 min 57 s |
Is 15057 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 (15057 ÷ 3 = 5019) | 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 2) | 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 | Yes (15057 ÷ 7 = 2151) | 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 (15057 ÷ 9 = 1673) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 15057 a prime number?
No. 15057 = × 7 × 239, so it is divisible by 3.
What are the factors of 15057?
1, 3, 7, 9, 21, 63, 239, 717, 1673, 2151, 5019, 15057.
What is 15057 in binary?
11101011010001 (hexadecimal 3AD1, octal 35321).
What is the square root of 15057?
About 122.7070, exactly 3√1673.
Is 15057 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15057?
15057 is a happy number: repeatedly adding the squares of its digits reaches 1.