The number 15231
15231 is a composite number with 4 divisors. Its prime factorisation is 3 × 5077. Divisors (4): 1, 3, 5077, 15231.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15231: a semiprime: 3 × 5077, the product of two primes.
- 2
15231 is composite. Its prime factorisation is
- 3
The divisors add up to 20312; without 15231 itself that is 5081, so 15231 is deficient (5081 is less than 15231). Euler's totient φ(15231) = 10152 numbers up to 15231 share no factor with it.
- 4
The digits of 15231 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15231 = 3 \times 5077 \]
15231 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20312 |
| Euler totient φ(n) | 10152 |
| Square | 231983361 |
| Cube | 3533338571391 |
| Square root | 123.413938 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.5231 × |
15231 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and thirty-one |
| Binary (base 2) | 11101101111111 |
| Octal (base 8) | 35577 |
| Hexadecimal (base 16) | 3B7F |
| Base 3 | 202220010 |
| As time | 15231 seconds = 4 h 13 min 51 s |
Is 15231 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 (15231 ÷ 3 = 5077) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15231 a prime number?
No. 15231 = 3 × 5077, so it is divisible by 3.
What are the factors of 15231?
1, 3, 5077, 15231.
What is 15231 in binary?
11101101111111 (hexadecimal 3B7F, octal 35577).
What is the square root of 15231?
About 123.4139.
Is 15231 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 15231?
15231 is a semiprime: 3 × 5077, the product of two primes.