WordGPT

The number 71501

71501 is a composite number with 4 divisors. Its prime factorisation is 127 × 563. Divisors (4): 1, 127, 563, 71501.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 71501: a semiprime: 127 × 563, the product of two primes.

  2. 2

    71501 is composite. Its prime factorisation is

    71501=127×56371501 = 127 \times 563
  3. 3

    The divisors add up to 72192; without 71501 itself that is 691, so 71501 is deficient (691 is less than 71501). Euler's totient φ(71501) = 70812 numbers up to 71501 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 71501 = 127 \times 563 \]

71501 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors72192
Euler totient φ(n)70812
Square5112393001
Cube365541211964501
Square root267.396709
Digit sum / digital root14 / 5
Collatz steps to 199
Scientific notation7.1501 × 10410^{4}

71501 in other forms

FormValue
In wordsseventy-one thousand five hundred and one
Binary (base 2)10001011101001101
Octal (base 8)213515
Hexadecimal (base 16)1174D
Base 310122002012
As time71501 seconds = 19 h 51 min 41 s

Is 71501 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 1)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 3)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 5)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 1)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 5)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 71501 a prime number?

No. 71501 = 127 × 563, so it is divisible by 127.

What are the factors of 71501?

1, 127, 563, 71501.

What is 71501 in binary?

10001011101001101 (hexadecimal 1174D, octal 213515).

What is the square root of 71501?

About 267.3967.

Is 71501 divisible by 3?

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

What is special about the number 71501?

71501 is a semiprime: 127 × 563, the product of two primes.

Find the next one

Nearby numbers

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