The number 46330
46330 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 41 × 113. Divisors (16): 1, 2, 5, 10, 41, 82, 113, 205, 226, 410, 565, 1130, 4633, 9266, 23165, 46330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46330: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
46330 is composite. Its prime factorisation is
- 3
The divisors add up to 86184; without 46330 itself that is 39854, so 46330 is deficient (39854 is less than 46330). Euler's totient φ(46330) = 17920 numbers up to 46330 share no factor with it.
- 4
The digits of 46330 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46330 = 2 \times 5 \times 41 \times 113 \]
46330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 86184 |
| Euler totient φ(n) | 17920 |
| Square | 2146468900 |
| Cube | 99445904137000 |
| Square root | 215.244048 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.633 × |
46330 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand three hundred and thirty |
| Binary (base 2) | 1011010011111010 |
| Octal (base 8) | 132372 |
| Hexadecimal (base 16) | B4FA |
| Base 3 | 2100112221 |
| As time | 46330 seconds = 12 h 52 min 10 s |
Is 46330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46330 ÷ 2 = 23165) | 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 (46330 ÷ 5 = 9266) | 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 4) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (46330 ÷ 10 = 4633) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 46330 a prime number?
No. 46330 = 2 × 5 × 41 × 113, so it is divisible by 2.
What are the factors of 46330?
1, 2, 5, 10, 41, 82, 113, 205, 226, 410, 565, 1130, 4633, 9266, 23165, 46330.
What is 46330 in binary?
1011010011111010 (hexadecimal B4FA, octal 132372).
What is the square root of 46330?
About 215.2440.
Is 46330 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 46330?
46330 is a happy number: repeatedly adding the squares of its digits reaches 1.