WordGPT

The number 15971

15971 is a twin prime (15971 and 15973 are both prime) and the 1860th prime number. Its only divisors are 1 and 15971.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 15971: a twin prime (15971 and 15973 are both prime); the 1860th prime number.

  2. 2

    15971 is prime, so its only factors are 1 and 15971. It is the 1860th prime; the next prime is 15973 and the one before is 15959.

  3. 3

    The divisors add up to 15972; without 15971 itself that is 1, so 15971 is deficient (1 is less than 15971). Euler's totient φ(15971) = 15970 numbers up to 15971 share no factor with it.

  4. 4

    The digits of 15971 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.

15971 at a glance

PropertyValue
Typeprime
Number of divisors2
Sum of divisors15972
Euler totient φ(n)15970
Square255072841
Cube4073768343611
Square root126.376422
Digit sum / digital root23 / 5
Collatz steps to 153
Scientific notation1.5971 × 10410^{4}

15971 in other forms

FormValue
In wordsfifteen thousand nine hundred and seventy-one
Binary (base 2)11111001100011
Octal (base 8)37143
Hexadecimal (base 16)3E63
Base 3210220112
As time15971 seconds = 4 h 26 min 11 s

Is 15971 divisible by 2 to 12?

DivisorAnswerRule
2No (remainder 1)A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8).
3No (remainder 2)A number is divisible by 3 if the digits add up to a multiple of 3.
4No (remainder 3)A number is divisible by 4 if the last two digits make a multiple of 4.
5No (remainder 1)A number is divisible by 5 if the last digit is 0 or 5.
6No (remainder 5)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (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.
8No (remainder 3)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 5)A number is divisible by 9 if the digits add up to a multiple of 9.
10No (remainder 1)A number is divisible by 10 if the last digit is 0.
11No (remainder 10)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 11)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 15971 a prime number?

Yes. 15971 is divisible only by 1 and itself.

What are the factors of 15971?

1, 15971.

What is 15971 in binary?

11111001100011 (hexadecimal 3E63, octal 37143).

What is the square root of 15971?

About 126.3764.

Is 15971 divisible by 3?

No. Its digits add up to 23, which is not a multiple of 3.

What is special about the number 15971?

15971 is a twin prime (15971 and 15973 are both prime); the 1860th prime number.

All about 15971

Find the next one

Nearby numbers

    15971: is it prime? Factors, square root, binary, Roman numeral | WordGPT