The number 46935
46935 is a composite number with 24 divisors. Its prime factorisation is × 5 × 7 × 149. Divisors (24): 1, 3, 5, 7, 9, 15, 21, 35, 45, 63, 105, 149, 315, 447, 745, 1043 … 46935.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46935: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
46935 is composite. Its prime factorisation is
- 3
The divisors add up to 93600; without 46935 itself that is 46665, so 46935 is deficient (46665 is less than 46935). Euler's totient φ(46935) = 21312 numbers up to 46935 share no factor with it.
- 4
The digits of 46935 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46935 = 3^{2} \times 5 \times 7 \times 149 \]46935 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 93600 |
| Euler totient φ(n) | 21312 |
| Square | 2202894225 |
| Cube | 103392840450375 |
| Square root | 216.644871 (= 3√5215) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6935 × |
46935 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and thirty-five |
| Binary (base 2) | 1011011101010111 |
| Octal (base 8) | 133527 |
| Hexadecimal (base 16) | B757 |
| Base 3 | 2101101100 |
| As time | 46935 seconds = 13 h 2 min 15 s |
Is 46935 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 (46935 ÷ 3 = 15645) | 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 (46935 ÷ 5 = 9387) | 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 | Yes (46935 ÷ 7 = 6705) | 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 (46935 ÷ 9 = 5215) | 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 9) | 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 46935 a prime number?
No. 46935 = × 5 × 7 × 149, so it is divisible by 3.
What are the factors of 46935?
1, 3, 5, 7, 9, 15, 21, 35, 45, 63, 105, 149, 315, 447, 745, 1043, 1341, 2235, 3129, 5215, 6705, 9387, 15645, 46935.
What is 46935 in binary?
1011011101010111 (hexadecimal B757, octal 133527).
What is the square root of 46935?
About 216.6449, exactly 3√5215.
Is 46935 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 46935?
46935 is a happy number: repeatedly adding the squares of its digits reaches 1.