The number 55929
55929 is a composite number with 8 divisors. Its prime factorisation is 3 × 103 × 181. Divisors (8): 1, 3, 103, 181, 309, 543, 18643, 55929.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55929 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55929 is composite. Its prime factorisation is
- 3
The divisors add up to 75712; without 55929 itself that is 19783, so 55929 is deficient (19783 is less than 55929). Euler's totient φ(55929) = 36720 numbers up to 55929 share no factor with it.
- 4
The digits of 55929 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55929 = 3 \times 103 \times 181 \]
55929 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75712 |
| Euler totient φ(n) | 36720 |
| Square | 3128053041 |
| Cube | 174948878530089 |
| Square root | 236.493129 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5929 × |
55929 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and twenty-nine |
| Binary (base 2) | 1101101001111001 |
| Octal (base 8) | 155171 |
| Hexadecimal (base 16) | DA79 |
| Base 3 | 2211201110 |
| As time | 55929 seconds = 15 h 32 min 9 s |
Is 55929 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 (55929 ÷ 3 = 18643) | 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 4) | 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 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 9) | 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 55929 a prime number?
No. 55929 = 3 × 103 × 181, so it is divisible by 3.
What are the factors of 55929?
1, 3, 103, 181, 309, 543, 18643, 55929.
What is 55929 in binary?
1101101001111001 (hexadecimal DA79, octal 155171).
What is the square root of 55929?
About 236.4931.
Is 55929 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 55929?
It is a composite number with 8 divisors.