The number 74857
74857 is the 7381st prime number. Its only divisors are 1 and 74857.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 74857: the 7381st prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
74857 is prime, so its only factors are 1 and 74857. It is the 7381st prime; the next prime is 74861 and the one before is 74843.
- 3
The divisors add up to 74858; without 74857 itself that is 1, so 74857 is deficient (1 is less than 74857). Euler's totient φ(74857) = 74856 numbers up to 74857 share no factor with it.
- 4
The digits of 74857 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 112 steps to reach 1.
74857 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 74858 |
| Euler totient φ(n) | 74856 |
| Square | 5603570449 |
| Cube | 419466473100793 |
| Square root | 273.600073 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 112 |
| Scientific notation | 7.4857 × |
74857 in other forms
| Form | Value |
|---|---|
| In words | seventy-four thousand eight hundred and fifty-seven |
| Binary (base 2) | 10010010001101001 |
| Octal (base 8) | 222151 |
| Hexadecimal (base 16) | 12469 |
| Base 3 | 10210200111 |
| As time | 74857 seconds = 20 h 47 min 37 s |
Is 74857 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 2) | 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 6) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 74857 a prime number?
Yes. 74857 is divisible only by 1 and itself.
What are the factors of 74857?
1, 74857.
What is 74857 in binary?
10010010001101001 (hexadecimal 12469, octal 222151).
What is the square root of 74857?
About 273.6001.
Is 74857 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 74857?
74857 is the 7381st prime number; a happy number: repeatedly adding the squares of its digits reaches 1.