The number 15229
15229 is a composite number with 4 divisors. Its prime factorisation is 97 × 157. Divisors (4): 1, 97, 157, 15229.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15229: a semiprime: 97 × 157, the product of two primes.
- 2
15229 is composite. Its prime factorisation is
- 3
The divisors add up to 15484; without 15229 itself that is 255, so 15229 is deficient (255 is less than 15229). Euler's totient φ(15229) = 14976 numbers up to 15229 share no factor with it.
- 4
The digits of 15229 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
\[ 15229 = 97 \times 157 \]
15229 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15484 |
| Euler totient φ(n) | 14976 |
| Square | 231922441 |
| Cube | 3531946853989 |
| Square root | 123.405835 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5229 × |
15229 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and twenty-nine |
| Binary (base 2) | 11101101111101 |
| Octal (base 8) | 35575 |
| Hexadecimal (base 16) | 3B7D |
| Base 3 | 202220001 |
| As time | 15229 seconds = 4 h 13 min 49 s |
Is 15229 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 | No (remainder 4) | 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 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 15229 a prime number?
No. 15229 = 97 × 157, so it is divisible by 97.
What are the factors of 15229?
1, 97, 157, 15229.
What is 15229 in binary?
11101101111101 (hexadecimal 3B7D, octal 35575).
What is the square root of 15229?
About 123.4058.
Is 15229 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 15229?
15229 is a semiprime: 97 × 157, the product of two primes.