The number 40152
40152 is a composite number with 32 divisors. Its prime factorisation is × 3 × 7 × 239. Divisors (32): 1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 168 … 40152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40152: a Harshad number: divisible by its digit sum 12.
- 2
40152 is composite. Its prime factorisation is
- 3
The divisors add up to 115200; without 40152 itself that is 75048, so 40152 is abundant (75048 is more than 40152). Euler's totient φ(40152) = 11424 numbers up to 40152 share no factor with it.
- 4
The digits of 40152 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40152 = 2^{3} \times 3 \times 7 \times 239 \]40152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 115200 |
| Euler totient φ(n) | 11424 |
| Square | 1612183104 |
| Cube | 64732375991808 |
| Square root | 200.379640 (= 2√10038) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 67 |
| Scientific notation | 4.0152 × |
40152 in other forms
| Form | Value |
|---|---|
| In words | forty thousand one hundred and fifty-two |
| Binary (base 2) | 1001110011011000 |
| Octal (base 8) | 116330 |
| Hexadecimal (base 16) | 9CD8 |
| Base 3 | 2001002010 |
| As time | 40152 seconds = 11 h 9 min 12 s |
Is 40152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (40152 ÷ 2 = 20076) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (40152 ÷ 3 = 13384) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (40152 ÷ 4 = 10038) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (40152 ÷ 6 = 6692) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (40152 ÷ 7 = 5736) | 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 | Yes (40152 ÷ 8 = 5019) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (40152 ÷ 12 = 3346) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40152 a prime number?
No. 40152 = × 3 × 7 × 239, so it is divisible by 2.
What are the factors of 40152?
1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 168, 239, 478, 717, 956, 1434, 1673, 1912, 2868, 3346, 5019, 5736, 6692, 10038, 13384, 20076, 40152.
What is 40152 in binary?
1001110011011000 (hexadecimal 9CD8, octal 116330).
What is the square root of 40152?
About 200.3796, exactly 2√10038.
Is 40152 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 40152?
40152 is a Harshad number: divisible by its digit sum 12.