The number 58455
58455 is a composite number with 16 divisors. Its prime factorisation is × 5 × 433. Divisors (16): 1, 3, 5, 9, 15, 27, 45, 135, 433, 1299, 2165, 3897, 6495, 11691, 19485, 58455.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 58455: a Harshad number: divisible by its digit sum 27.
- 2
58455 is composite. Its prime factorisation is
- 3
The divisors add up to 104160; without 58455 itself that is 45705, so 58455 is deficient (45705 is less than 58455). Euler's totient φ(58455) = 31104 numbers up to 58455 share no factor with it.
- 4
The digits of 58455 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58455 = 3^{3} \times 5 \times 433 \]58455 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 104160 |
| Euler totient φ(n) | 31104 |
| Square | 3416987025 |
| Cube | 199739976546375 |
| Square root | 241.774689 (= 3√6495) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.8455 × |
58455 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand four hundred and fifty-five |
| Binary (base 2) | 1110010001010111 |
| Octal (base 8) | 162127 |
| Hexadecimal (base 16) | E457 |
| Base 3 | 2222012000 |
| As time | 58455 seconds = 16 h 14 min 15 s |
Is 58455 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 (58455 ÷ 3 = 19485) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (58455 ÷ 5 = 11691) | 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 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (58455 ÷ 9 = 6495) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58455 a prime number?
No. 58455 = × 5 × 433, so it is divisible by 3.
What are the factors of 58455?
1, 3, 5, 9, 15, 27, 45, 135, 433, 1299, 2165, 3897, 6495, 11691, 19485, 58455.
What is 58455 in binary?
1110010001010111 (hexadecimal E457, octal 162127).
What is the square root of 58455?
About 241.7747, exactly 3√6495.
Is 58455 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 58455?
58455 is a Harshad number: divisible by its digit sum 27.