The number 3153
3153 is a composite number with 4 divisors. Its prime factorisation is 3 × 1051. Divisors (4): 1, 3, 1051, 3153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3153: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 1051, the product of two primes.
- 2
3153 is composite. Its prime factorisation is
- 3
The divisors add up to 4208; without 3153 itself that is 1055, so 3153 is deficient (1055 is less than 3153). Euler's totient φ(3153) = 2100 numbers up to 3153 share no factor with it.
- 4
The digits of 3153 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 61 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3153 = 3 \times 1051 \]
3153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 4208 |
| Euler totient φ(n) | 2100 |
| Square | 9941409 |
| Cube | 31345262577 |
| Square root | 56.151581 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 61 |
| Scientific notation | 3.153 × |
3153 in other forms
| Form | Value |
|---|---|
| In words | three thousand one hundred and fifty-three |
| Roman numerals | MMMCLIII |
| Binary (base 2) | 110001010001 |
| Octal (base 8) | 6121 |
| Hexadecimal (base 16) | C51 |
| Base 3 | 11022210 |
| As time | 3153 seconds = 52 min 33 s |
Is 3153 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 (3153 ÷ 3 = 1051) | 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 3) | 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 3) | 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 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 3153 a prime number?
No. 3153 = 3 × 1051, so it is divisible by 3.
What are the factors of 3153?
1, 3, 1051, 3153.
What is 3153 in binary?
110001010001 (hexadecimal C51, octal 6121).
What is the square root of 3153?
About 56.1516.
What is 3153 in Roman numerals?
MMMCLIII.
Is 3153 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 3153?
3153 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 1051, the product of two primes.