The number 53013
53013 is a composite number with 8 divisors. Its prime factorisation is 3 × 41 × 431. Divisors (8): 1, 3, 41, 123, 431, 1293, 17671, 53013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53013: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
53013 is composite. Its prime factorisation is
- 3
The divisors add up to 72576; without 53013 itself that is 19563, so 53013 is deficient (19563 is less than 53013). Euler's totient φ(53013) = 34400 numbers up to 53013 share no factor with it.
- 4
The digits of 53013 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53013 = 3 \times 41 \times 431 \]
53013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72576 |
| Euler totient φ(n) | 34400 |
| Square | 2810378169 |
| Cube | 148986577873197 |
| Square root | 230.245521 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3013 × |
53013 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and thirteen |
| Binary (base 2) | 1100111100010101 |
| Octal (base 8) | 147425 |
| Hexadecimal (base 16) | CF15 |
| Base 3 | 2200201110 |
| As time | 53013 seconds = 14 h 43 min 33 s |
Is 53013 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 (53013 ÷ 3 = 17671) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53013 a prime number?
No. 53013 = 3 × 41 × 431, so it is divisible by 3.
What are the factors of 53013?
1, 3, 41, 123, 431, 1293, 17671, 53013.
What is 53013 in binary?
1100111100010101 (hexadecimal CF15, octal 147425).
What is the square root of 53013?
About 230.2455.
Is 53013 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 53013?
53013 is a happy number: repeatedly adding the squares of its digits reaches 1.