The number 40330
40330 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 37 × 109. Divisors (16): 1, 2, 5, 10, 37, 74, 109, 185, 218, 370, 545, 1090, 4033, 8066, 20165, 40330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40330: a Harshad number: divisible by its digit sum 10.
- 2
40330 is composite. Its prime factorisation is
- 3
The divisors add up to 75240; without 40330 itself that is 34910, so 40330 is deficient (34910 is less than 40330). Euler's totient φ(40330) = 15552 numbers up to 40330 share no factor with it.
- 4
The digits of 40330 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 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40330 = 2 \times 5 \times 37 \times 109 \]
40330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 75240 |
| Euler totient φ(n) | 15552 |
| Square | 1626508900 |
| Cube | 65597103937000 |
| Square root | 200.823305 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.033 × |
40330 in other forms
| Form | Value |
|---|---|
| In words | forty thousand three hundred and thirty |
| Binary (base 2) | 1001110110001010 |
| Octal (base 8) | 116612 |
| Hexadecimal (base 16) | 9D8A |
| Base 3 | 2001022201 |
| As time | 40330 seconds = 11 h 12 min 10 s |
Is 40330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (40330 ÷ 2 = 20165) | 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 (40330 ÷ 5 = 8066) | 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 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 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 (40330 ÷ 10 = 4033) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 40330 a prime number?
No. 40330 = 2 × 5 × 37 × 109, so it is divisible by 2.
What are the factors of 40330?
1, 2, 5, 10, 37, 74, 109, 185, 218, 370, 545, 1090, 4033, 8066, 20165, 40330.
What is 40330 in binary?
1001110110001010 (hexadecimal 9D8A, octal 116612).
What is the square root of 40330?
About 200.8233.
Is 40330 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 40330?
40330 is a Harshad number: divisible by its digit sum 10.