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