The number 46930
46930 is a composite number with 24 divisors. Its prime factorisation is 2 × 5 × 13 × . Divisors (24): 1, 2, 5, 10, 13, 19, 26, 38, 65, 95, 130, 190, 247, 361, 494, 722 … 46930.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46930 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46930 is composite. Its prime factorisation is
- 3
The divisors add up to 96012; without 46930 itself that is 49082, so 46930 is abundant (49082 is more than 46930). Euler's totient φ(46930) = 16416 numbers up to 46930 share no factor with it.
- 4
The digits of 46930 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46930 = 2 \times 5 \times 13 \times 19^{2} \]46930 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 96012 |
| Euler totient φ(n) | 16416 |
| Square | 2202424900 |
| Cube | 103359800557000 |
| Square root | 216.633331 (= 19√130) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.693 × |
46930 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and thirty |
| Binary (base 2) | 1011011101010010 |
| Octal (base 8) | 133522 |
| Hexadecimal (base 16) | B752 |
| Base 3 | 2101101011 |
| As time | 46930 seconds = 13 h 2 min 10 s |
Is 46930 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46930 ÷ 2 = 23465) | 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 (46930 ÷ 5 = 9386) | 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 2) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (46930 ÷ 10 = 4693) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 46930 a prime number?
No. 46930 = 2 × 5 × 13 × , so it is divisible by 2.
What are the factors of 46930?
1, 2, 5, 10, 13, 19, 26, 38, 65, 95, 130, 190, 247, 361, 494, 722, 1235, 1805, 2470, 3610, 4693, 9386, 23465, 46930.
What is 46930 in binary?
1011011101010010 (hexadecimal B752, octal 133522).
What is the square root of 46930?
About 216.6333, exactly 19√130.
Is 46930 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 46930?
It is a composite number with 24 divisors.