The number 34643
34643 is a palindrome: it reads 34643 backwards too. Its prime factorisation is Ć 101. Divisors (8): 1, 7, 49, 101, 343, 707, 4949, 34643.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 34643: a palindrome: it reads 34643 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
34643 is composite. Its prime factorisation is
- 3
The divisors add up to 40800; without 34643 itself that is 6157, so 34643 is deficient (6157 is less than 34643). Euler's totient Ļ(34643) = 29400 numbers up to 34643 share no factor with it.
- 4
The digits of 34643 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 173 steps to reach 1.
LaTeX source of the formulas on this page
\[ 34643 = 7^{3} \times 101 \]34643 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 40800 |
| Euler totient Ļ(n) | 29400 |
| Square | 1200137449 |
| Cube | 41576361645707 |
| Square root | 186.126301 (= 7ā707) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 173 |
| Scientific notation | 3.4643 Ć |
34643 in other forms
| Form | Value |
|---|---|
| In words | thirty-four thousand six hundred and forty-three |
| Binary (base 2) | 1000011101010011 |
| Octal (base 8) | 103523 |
| Hexadecimal (base 16) | 8753 |
| Base 3 | 1202112002 |
| As time | 34643 seconds = 9 h 37 min 23 s |
Is 34643 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 | No (remainder 2) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (34643 Ć· 7 = 4949) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 34643 a prime number?
No. 34643 = Ć 101, so it is divisible by 7.
What are the factors of 34643?
1, 7, 49, 101, 343, 707, 4949, 34643.
What is 34643 in binary?
1000011101010011 (hexadecimal 8753, octal 103523).
What is the square root of 34643?
About 186.1263, exactly 7ā707.
Is 34643 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 34643?
34643 is a palindrome: it reads 34643 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.