The number 15146
15146 is a composite number with 4 divisors. Its prime factorisation is 2 × 7573. Divisors (4): 1, 2, 7573, 15146.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15146: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 7573, the product of two primes.
- 2
15146 is composite. Its prime factorisation is
- 3
The divisors add up to 22722; without 15146 itself that is 7576, so 15146 is deficient (7576 is less than 15146). Euler's totient φ(15146) = 7572 numbers up to 15146 share no factor with it.
- 4
The digits of 15146 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 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15146 = 2 \times 7573 \]
15146 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 22722 |
| Euler totient φ(n) | 7572 |
| Square | 229401316 |
| Cube | 3474512332136 |
| Square root | 123.069086 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5146 × |
15146 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and forty-six |
| Binary (base 2) | 11101100101010 |
| Octal (base 8) | 35452 |
| Hexadecimal (base 16) | 3B2A |
| Base 3 | 202202222 |
| As time | 15146 seconds = 4 h 12 min 26 s |
Is 15146 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15146 ÷ 2 = 7573) | 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 1) | 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 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 2) | 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 6) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15146 a prime number?
No. 15146 = 2 × 7573, so it is divisible by 2.
What are the factors of 15146?
1, 2, 7573, 15146.
What is 15146 in binary?
11101100101010 (hexadecimal 3B2A, octal 35452).
What is the square root of 15146?
About 123.0691.
Is 15146 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 15146?
15146 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 7573, the product of two primes.