The number 15038
15038 is a composite number with 8 divisors. Its prime factorisation is 2 × 73 × 103. Divisors (8): 1, 2, 73, 103, 146, 206, 7519, 15038.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15038 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15038 is composite. Its prime factorisation is
- 3
The divisors add up to 23088; without 15038 itself that is 8050, so 15038 is deficient (8050 is less than 15038). Euler's totient φ(15038) = 7344 numbers up to 15038 share no factor with it.
- 4
The digits of 15038 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15038 = 2 \times 73 \times 103 \]
15038 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23088 |
| Euler totient φ(n) | 7344 |
| Square | 226141444 |
| Cube | 3400715034872 |
| Square root | 122.629523 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.5038 × |
15038 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and thirty-eight |
| Binary (base 2) | 11101010111110 |
| Octal (base 8) | 35276 |
| Hexadecimal (base 16) | 3ABE |
| Base 3 | 202121222 |
| As time | 15038 seconds = 4 h 10 min 38 s |
Is 15038 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15038 ÷ 2 = 7519) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15038 a prime number?
No. 15038 = 2 × 73 × 103, so it is divisible by 2.
What are the factors of 15038?
1, 2, 73, 103, 146, 206, 7519, 15038.
What is 15038 in binary?
11101010111110 (hexadecimal 3ABE, octal 35276).
What is the square root of 15038?
About 122.6295.
Is 15038 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 15038?
It is a composite number with 8 divisors.