The number 1495
1495 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 23. Divisors (8): 1, 5, 13, 23, 65, 115, 299, 1495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1495 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1495 is composite. Its prime factorisation is
- 3
The divisors add up to 2016; without 1495 itself that is 521, so 1495 is deficient (521 is less than 1495). Euler's totient φ(1495) = 1056 numbers up to 1495 share no factor with it.
- 4
The digits of 1495 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 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1495 = 5 \times 13 \times 23 \]
1495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2016 |
| Euler totient φ(n) | 1056 |
| Square | 2235025 |
| Cube | 3341362375 |
| Square root | 38.665230 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 47 |
| Scientific notation | 1.495 × |
1495 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and ninety-five |
| Roman numerals | MCDXCV |
| Binary (base 2) | 10111010111 |
| Octal (base 8) | 2727 |
| Hexadecimal (base 16) | 5D7 |
| Base 3 | 2001101 |
| As time | 1495 seconds = 24 min 55 s |
Is 1495 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 | Yes (1495 ÷ 5 = 299) | 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 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 1495 a prime number?
No. 1495 = 5 × 13 × 23, so it is divisible by 5.
What are the factors of 1495?
1, 5, 13, 23, 65, 115, 299, 1495.
What is 1495 in binary?
10111010111 (hexadecimal 5D7, octal 2727).
What is the square root of 1495?
About 38.6652.
What is 1495 in Roman numerals?
MCDXCV.
Is 1495 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 1495?
It is a composite number with 8 divisors.