WordGPT

The number 55801

55801 is a composite number with 4 divisors. Its prime factorisation is 41 × 1361. Divisors (4): 1, 41, 1361, 55801.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 55801: a semiprime: 41 × 1361, the product of two primes.

  2. 2

    55801 is composite. Its prime factorisation is

    55801=41×136155801 = 41 \times 1361
  3. 3

    The divisors add up to 57204; without 55801 itself that is 1403, so 55801 is deficient (1403 is less than 55801). Euler's totient φ(55801) = 54400 numbers up to 55801 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 55801 = 41 \times 1361 \]

55801 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors57204
Euler totient φ(n)54400
Square3113751601
Cube173750453087401
Square root236.222353
Digit sum / digital root19 / 1
Collatz steps to 1135
Scientific notation5.5801 × 10410^{4}

55801 in other forms

FormValue
In wordsfifty-five thousand eight hundred and one
Binary (base 2)1101100111111001
Octal (base 8)154771
Hexadecimal (base 16)D9F9
Base 32211112201
As time55801 seconds = 15 h 30 min 1 s

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

Questions

Is 55801 a prime number?

No. 55801 = 41 × 1361, so it is divisible by 41.

What are the factors of 55801?

1, 41, 1361, 55801.

What is 55801 in binary?

1101100111111001 (hexadecimal D9F9, octal 154771).

What is the square root of 55801?

About 236.2224.

Is 55801 divisible by 3?

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

What is special about the number 55801?

55801 is a semiprime: 41 × 1361, the product of two primes.

Find the next one

Nearby numbers

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