The number 13330
13330 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 31 × 43. Divisors (16): 1, 2, 5, 10, 31, 43, 62, 86, 155, 215, 310, 430, 1333, 2666, 6665, 13330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13330: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 10.
- 2
13330 is composite. Its prime factorisation is
- 3
The divisors add up to 25344; without 13330 itself that is 12014, so 13330 is deficient (12014 is less than 13330). Euler's totient φ(13330) = 5040 numbers up to 13330 share no factor with it.
- 4
The digits of 13330 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13330 = 2 \times 5 \times 31 \times 43 \]
13330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 25344 |
| Euler totient φ(n) | 5040 |
| Square | 177688900 |
| Cube | 2368593037000 |
| Square root | 115.455619 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.333 × |
13330 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand three hundred and thirty |
| Binary (base 2) | 11010000010010 |
| Octal (base 8) | 32022 |
| Hexadecimal (base 16) | 3412 |
| Base 3 | 200021201 |
| As time | 13330 seconds = 3 h 42 min 10 s |
Is 13330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13330 ÷ 2 = 6665) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (13330 ÷ 5 = 2666) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (13330 ÷ 10 = 1333) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13330 a prime number?
No. 13330 = 2 × 5 × 31 × 43, so it is divisible by 2.
What are the factors of 13330?
1, 2, 5, 10, 31, 43, 62, 86, 155, 215, 310, 430, 1333, 2666, 6665, 13330.
What is 13330 in binary?
11010000010010 (hexadecimal 3412, octal 32022).
What is the square root of 13330?
About 115.4556.
Is 13330 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 13330?
13330 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 10.