The number 13370
13370 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 191. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 191, 382, 955, 1337, 1910, 2674, 6685, 13370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13370: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 14.
- 2
13370 is composite. Its prime factorisation is
- 3
The divisors add up to 27648; without 13370 itself that is 14278, so 13370 is abundant (14278 is more than 13370). Euler's totient φ(13370) = 4560 numbers up to 13370 share no factor with it.
- 4
The digits of 13370 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13370 = 2 \times 5 \times 7 \times 191 \]
13370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 27648 |
| Euler totient φ(n) | 4560 |
| Square | 178756900 |
| Cube | 2389979753000 |
| Square root | 115.628716 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.337 × |
13370 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand three hundred and seventy |
| Binary (base 2) | 11010000111010 |
| Octal (base 8) | 32072 |
| Hexadecimal (base 16) | 343A |
| Base 3 | 200100012 |
| As time | 13370 seconds = 3 h 42 min 50 s |
Is 13370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13370 ÷ 2 = 6685) | 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 | Yes (13370 ÷ 5 = 2674) | 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 | Yes (13370 ÷ 7 = 1910) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (13370 ÷ 10 = 1337) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13370 a prime number?
No. 13370 = 2 × 5 × 7 × 191, so it is divisible by 2.
What are the factors of 13370?
1, 2, 5, 7, 10, 14, 35, 70, 191, 382, 955, 1337, 1910, 2674, 6685, 13370.
What is 13370 in binary?
11010000111010 (hexadecimal 343A, octal 32072).
What is the square root of 13370?
About 115.6287.
Is 13370 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 13370?
13370 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 14.