The number 40593
40593 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 1933. Divisors (8): 1, 3, 7, 21, 1933, 5799, 13531, 40593.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40593: a Harshad number: divisible by its digit sum 21.
- 2
40593 is composite. Its prime factorisation is
- 3
The divisors add up to 61888; without 40593 itself that is 21295, so 40593 is deficient (21295 is less than 40593). Euler's totient φ(40593) = 23184 numbers up to 40593 share no factor with it.
- 4
The digits of 40593 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40593 = 3 \times 7 \times 1933 \]
40593 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 61888 |
| Euler totient φ(n) | 23184 |
| Square | 1647791649 |
| Cube | 66888806407857 |
| Square root | 201.477046 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 137 |
| Scientific notation | 4.0593 × |
40593 in other forms
| Form | Value |
|---|---|
| In words | forty thousand five hundred and ninety-three |
| Binary (base 2) | 1001111010010001 |
| Octal (base 8) | 117221 |
| Hexadecimal (base 16) | 9E91 |
| Base 3 | 2001200110 |
| As time | 40593 seconds = 11 h 16 min 33 s |
Is 40593 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 (40593 ÷ 3 = 13531) | 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 | Yes (40593 ÷ 7 = 5799) | 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 3) | 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 40593 a prime number?
No. 40593 = 3 × 7 × 1933, so it is divisible by 3.
What are the factors of 40593?
1, 3, 7, 21, 1933, 5799, 13531, 40593.
What is 40593 in binary?
1001111010010001 (hexadecimal 9E91, octal 117221).
What is the square root of 40593?
About 201.4770.
Is 40593 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 40593?
40593 is a Harshad number: divisible by its digit sum 21.