The number 37063
37063 is a composite number with 4 divisors. Its prime factorisation is 13 × 2851. Divisors (4): 1, 13, 2851, 37063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 37063: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 2851, the product of two primes.
- 2
37063 is composite. Its prime factorisation is
- 3
The divisors add up to 39928; without 37063 itself that is 2865, so 37063 is deficient (2865 is less than 37063). Euler's totient φ(37063) = 34200 numbers up to 37063 share no factor with it.
- 4
The digits of 37063 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 142 steps to reach 1.
LaTeX source of the formulas on this page
\[ 37063 = 13 \times 2851 \]
37063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 39928 |
| Euler totient φ(n) | 34200 |
| Square | 1373665969 |
| Cube | 50912181809047 |
| Square root | 192.517532 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 142 |
| Scientific notation | 3.7063 × |
37063 in other forms
| Form | Value |
|---|---|
| In words | thirty-seven thousand and sixty-three |
| Binary (base 2) | 1001000011000111 |
| Octal (base 8) | 110307 |
| Hexadecimal (base 16) | 90C7 |
| Base 3 | 1212211201 |
| As time | 37063 seconds = 10 h 17 min 43 s |
Is 37063 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 37063 a prime number?
No. 37063 = 13 × 2851, so it is divisible by 13.
What are the factors of 37063?
1, 13, 2851, 37063.
What is 37063 in binary?
1001000011000111 (hexadecimal 90C7, octal 110307).
What is the square root of 37063?
About 192.5175.
Is 37063 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 37063?
37063 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 2851, the product of two primes.