WordGPT

The number 55802

55802 is a composite number with 4 divisors. Its prime factorisation is 2 × 27901. Divisors (4): 1, 2, 27901, 55802.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 55802: a semiprime: 2 × 27901, the product of two primes.

  2. 2

    55802 is composite. Its prime factorisation is

    55802=2×2790155802 = 2 \times 27901
  3. 3

    The divisors add up to 83706; without 55802 itself that is 27904, so 55802 is deficient (27904 is less than 55802). Euler's totient φ(55802) = 27900 numbers up to 55802 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 55802 = 2 \times 27901 \]

55802 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors83706
Euler totient φ(n)27900
Square3113863204
Cube173759794509608
Square root236.224470
Digit sum / digital root20 / 2
Collatz steps to 1135
Scientific notation5.5802 × 10410^{4}

55802 in other forms

FormValue
In wordsfifty-five thousand eight hundred and two
Binary (base 2)1101100111111010
Octal (base 8)154772
Hexadecimal (base 16)D9FA
Base 32211112202
As time55802 seconds = 15 h 30 min 2 s

Is 55802 divisible by 2 to 12?

DivisorAnswerRule
2Yes (55802 ÷ 2 = 27901)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 2)A number is divisible by 4 if the last two digits make a multiple of 4.
5No (remainder 2)A number is divisible by 5 if the last digit is 0 or 5.
6No (remainder 2)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (remainder 5)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 2)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 2)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 2)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 55802 a prime number?

No. 55802 = 2 × 27901, so it is divisible by 2.

What are the factors of 55802?

1, 2, 27901, 55802.

What is 55802 in binary?

1101100111111010 (hexadecimal D9FA, octal 154772).

What is the square root of 55802?

About 236.2245.

Is 55802 divisible by 3?

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

What is special about the number 55802?

55802 is a semiprime: 2 × 27901, the product of two primes.

Find the next one

Nearby numbers

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