The number 83953
83953 is a composite number with 4 divisors. Its prime factorisation is 37 × 2269. Divisors (4): 1, 37, 2269, 83953.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 83953: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 37 × 2269, the product of two primes.
- 2
83953 is composite. Its prime factorisation is
- 3
The divisors add up to 86260; without 83953 itself that is 2307, so 83953 is deficient (2307 is less than 83953). Euler's totient φ(83953) = 81648 numbers up to 83953 share no factor with it.
- 4
The digits of 83953 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83953 = 37 \times 2269 \]
83953 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 86260 |
| Euler totient φ(n) | 81648 |
| Square | 7048106209 |
| Cube | 591709660564177 |
| Square root | 289.746441 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 107 |
| Scientific notation | 8.3953 × |
83953 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand nine hundred and fifty-three |
| Binary (base 2) | 10100011111110001 |
| Octal (base 8) | 243761 |
| Hexadecimal (base 16) | 147F1 |
| Base 3 | 11021011101 |
| As time | 83953 seconds = 23 h 19 min 13 s |
Is 83953 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 1) | 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 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 83953 a prime number?
No. 83953 = 37 × 2269, so it is divisible by 37.
What are the factors of 83953?
1, 37, 2269, 83953.
What is 83953 in binary?
10100011111110001 (hexadecimal 147F1, octal 243761).
What is the square root of 83953?
About 289.7464.
Is 83953 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 83953?
83953 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 37 × 2269, the product of two primes.