The number 1413
1413 is a composite number with 6 divisors. Its prime factorisation is × 157. Divisors (6): 1, 3, 9, 157, 471, 1413.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1413: a Harshad number: divisible by its digit sum 9.
- 2
1413 is composite. Its prime factorisation is
- 3
The divisors add up to 2054; without 1413 itself that is 641, so 1413 is deficient (641 is less than 1413). Euler's totient φ(1413) = 936 numbers up to 1413 share no factor with it.
- 4
The digits of 1413 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1413 = 3^{2} \times 157 \]1413 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 2054 |
| Euler totient φ(n) | 936 |
| Square | 1996569 |
| Cube | 2821151997 |
| Square root | 37.589892 (= 3√157) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 127 |
| Scientific notation | 1.413 × |
1413 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and thirteen |
| Roman numerals | MCDXIII |
| Binary (base 2) | 10110000101 |
| Octal (base 8) | 2605 |
| Hexadecimal (base 16) | 585 |
| Base 3 | 1221100 |
| As time | 1413 seconds = 23 min 33 s |
Is 1413 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 (1413 ÷ 3 = 471) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (1413 ÷ 9 = 157) | 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 5) | 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 1413 a prime number?
No. 1413 = × 157, so it is divisible by 3.
What are the factors of 1413?
1, 3, 9, 157, 471, 1413.
What is 1413 in binary?
10110000101 (hexadecimal 585, octal 2605).
What is the square root of 1413?
About 37.5899, exactly 3√157.
What is 1413 in Roman numerals?
MCDXIII.
Is 1413 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 1413?
1413 is a Harshad number: divisible by its digit sum 9.