The number 46959
46959 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1423. Divisors (8): 1, 3, 11, 33, 1423, 4269, 15653, 46959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46959: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 33.
- 2
46959 is composite. Its prime factorisation is
- 3
The divisors add up to 68352; without 46959 itself that is 21393, so 46959 is deficient (21393 is less than 46959). Euler's totient φ(46959) = 28440 numbers up to 46959 share no factor with it.
- 4
The digits of 46959 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 132 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46959 = 3 \times 11 \times 1423 \]
46959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68352 |
| Euler totient φ(n) | 28440 |
| Square | 2205147681 |
| Cube | 103551529952079 |
| Square root | 216.700254 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 132 |
| Scientific notation | 4.6959 × |
46959 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and fifty-nine |
| Binary (base 2) | 1011011101101111 |
| Octal (base 8) | 133557 |
| Hexadecimal (base 16) | B76F |
| Base 3 | 2101102020 |
| As time | 46959 seconds = 13 h 2 min 39 s |
Is 46959 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 (46959 ÷ 3 = 15653) | 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 | 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 3) | 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 | No (remainder 6) | 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 | Yes (46959 ÷ 11 = 4269) | 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 46959 a prime number?
No. 46959 = 3 × 11 × 1423, so it is divisible by 3.
What are the factors of 46959?
1, 3, 11, 33, 1423, 4269, 15653, 46959.
What is 46959 in binary?
1011011101101111 (hexadecimal B76F, octal 133557).
What is the square root of 46959?
About 216.7003.
Is 46959 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 46959?
46959 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 33.