WordGPT

The number 68081

68081 is a composite number with 4 divisors. Its prime factorisation is 13 × 5237. Divisors (4): 1, 13, 5237, 68081.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 68081: a semiprime: 13 × 5237, the product of two primes.

  2. 2

    68081 is composite. Its prime factorisation is

    68081=13×523768081 = 13 \times 5237
  3. 3

    The divisors add up to 73332; without 68081 itself that is 5251, so 68081 is deficient (5251 is less than 68081). Euler's totient φ(68081) = 62832 numbers up to 68081 share no factor with it.

  4. 4

    The digits of 68081 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 81 steps to reach 1.

LaTeX source of the formulas on this page
\[ 68081 = 13 \times 5237 \]

68081 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors73332
Euler totient φ(n)62832
Square4635022561
Cube315556970975441
Square root260.923360
Digit sum / digital root23 / 5
Collatz steps to 181
Scientific notation6.8081 × 10410^{4}

68081 in other forms

FormValue
In wordssixty-eight thousand and eighty-one
Binary (base 2)10000100111110001
Octal (base 8)204761
Hexadecimal (base 16)109F1
Base 310110101112
As time68081 seconds = 18 h 54 min 41 s

Is 68081 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 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 1)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 2)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 68081 a prime number?

No. 68081 = 13 × 5237, so it is divisible by 13.

What are the factors of 68081?

1, 13, 5237, 68081.

What is 68081 in binary?

10000100111110001 (hexadecimal 109F1, octal 204761).

What is the square root of 68081?

About 260.9234.

Is 68081 divisible by 3?

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

What is special about the number 68081?

68081 is a semiprime: 13 × 5237, the product of two primes.

Find the next one

Nearby numbers

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