WordGPT

The number 83971

83971 is a composite number with 4 divisors. Its prime factorisation is 131 × 641. Divisors (4): 1, 131, 641, 83971.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 83971: a semiprime: 131 × 641, the product of two primes.

  2. 2

    83971 is composite. Its prime factorisation is

    83971=131×64183971 = 131 \times 641
  3. 3

    The divisors add up to 84744; without 83971 itself that is 773, so 83971 is deficient (773 is less than 83971). Euler's totient φ(83971) = 83200 numbers up to 83971 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 83971 = 131 \times 641 \]

83971 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors84744
Euler totient φ(n)83200
Square7051128841
Cube592090339907611
Square root289.777501
Digit sum / digital root28 / 1
Collatz steps to 1120
Scientific notation8.3971 × 10410^{4}

83971 in other forms

FormValue
In wordseighty-three thousand nine hundred and seventy-one
Binary (base 2)10100100000000011
Octal (base 8)244003
Hexadecimal (base 16)14803
Base 311021012001
As time83971 seconds = 23 h 19 min 31 s

Is 83971 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 1)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 1)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (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.
8No (remainder 3)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 1)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 8)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 7)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 83971 a prime number?

No. 83971 = 131 × 641, so it is divisible by 131.

What are the factors of 83971?

1, 131, 641, 83971.

What is 83971 in binary?

10100100000000011 (hexadecimal 14803, octal 244003).

What is the square root of 83971?

About 289.7775.

Is 83971 divisible by 3?

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

What is special about the number 83971?

83971 is a semiprime: 131 × 641, the product of two primes.

Find the next one

Nearby numbers

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