The number 93013
93013 is a composite number with 4 divisors. Its prime factorisation is 47 × 1979. Divisors (4): 1, 47, 1979, 93013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93013: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1979, the product of two primes.
- 2
93013 is composite. Its prime factorisation is
- 3
The divisors add up to 95040; without 93013 itself that is 2027, so 93013 is deficient (2027 is less than 93013). Euler's totient φ(93013) = 90988 numbers up to 93013 share no factor with it.
- 4
The digits of 93013 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93013 = 47 \times 1979 \]
93013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 95040 |
| Euler totient φ(n) | 90988 |
| Square | 8651418169 |
| Cube | 804694358153197 |
| Square root | 304.980327 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.3013 × |
93013 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand and thirteen |
| Binary (base 2) | 10110101101010101 |
| Octal (base 8) | 265525 |
| Hexadecimal (base 16) | 16B55 |
| Base 3 | 11201120221 |
| As time | 93013 seconds = 25 h 50 min 13 s |
Is 93013 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 8) | 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 93013 a prime number?
No. 93013 = 47 × 1979, so it is divisible by 47.
What are the factors of 93013?
1, 47, 1979, 93013.
What is 93013 in binary?
10110101101010101 (hexadecimal 16B55, octal 265525).
What is the square root of 93013?
About 304.9803.
Is 93013 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 93013?
93013 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1979, the product of two primes.