WordGPT

The number 70751

70751 is a composite number with 4 divisors. Its prime factorisation is 139 × 509. Divisors (4): 1, 139, 509, 70751.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 70751: a semiprime: 139 × 509, the product of two primes.

  2. 2

    70751 is composite. Its prime factorisation is

    70751=139×50970751 = 139 \times 509
  3. 3

    The divisors add up to 71400; without 70751 itself that is 649, so 70751 is deficient (649 is less than 70751). Euler's totient φ(70751) = 70104 numbers up to 70751 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 70751 = 139 \times 509 \]

70751 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors71400
Euler totient φ(n)70104
Square5005704001
Cube354158563774751
Square root265.990601
Digit sum / digital root20 / 2
Collatz steps to 181
Scientific notation7.0751 × 10410^{4}

70751 in other forms

FormValue
In wordsseventy thousand seven hundred and fifty-one
Binary (base 2)10001010001011111
Octal (base 8)212137
Hexadecimal (base 16)1145F
Base 310121001102
As time70751 seconds = 19 h 39 min 11 s

Is 70751 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 2)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 7)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 2)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 70751 a prime number?

No. 70751 = 139 × 509, so it is divisible by 139.

What are the factors of 70751?

1, 139, 509, 70751.

What is 70751 in binary?

10001010001011111 (hexadecimal 1145F, octal 212137).

What is the square root of 70751?

About 265.9906.

Is 70751 divisible by 3?

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

What is special about the number 70751?

70751 is a semiprime: 139 × 509, the product of two primes.

Find the next one

Nearby numbers

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