The number 46953
46953 is a composite number with 16 divisors. Its prime factorisation is × 37 × 47. Divisors (16): 1, 3, 9, 27, 37, 47, 111, 141, 333, 423, 999, 1269, 1739, 5217, 15651, 46953.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46953: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
46953 is composite. Its prime factorisation is
- 3
The divisors add up to 72960; without 46953 itself that is 26007, so 46953 is deficient (26007 is less than 46953). Euler's totient φ(46953) = 29808 numbers up to 46953 share no factor with it.
- 4
The digits of 46953 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46953 = 3^{3} \times 37 \times 47 \]46953 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 72960 |
| Euler totient φ(n) | 29808 |
| Square | 2204584209 |
| Cube | 103511842365177 |
| Square root | 216.686409 (= 3√5217) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.6953 × |
46953 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and fifty-three |
| Binary (base 2) | 1011011101101001 |
| Octal (base 8) | 133551 |
| Hexadecimal (base 16) | B769 |
| Base 3 | 2101102000 |
| As time | 46953 seconds = 13 h 2 min 33 s |
Is 46953 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 (46953 ÷ 3 = 15651) | 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 3) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (46953 ÷ 9 = 5217) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 46953 a prime number?
No. 46953 = × 37 × 47, so it is divisible by 3.
What are the factors of 46953?
1, 3, 9, 27, 37, 47, 111, 141, 333, 423, 999, 1269, 1739, 5217, 15651, 46953.
What is 46953 in binary?
1011011101101001 (hexadecimal B769, octal 133551).
What is the square root of 46953?
About 216.6864, exactly 3√5217.
Is 46953 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 46953?
46953 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.