WordGPT

The number 55810

55810 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5581. Divisors (8): 1, 2, 5, 10, 5581, 11162, 27905, 55810.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    55810 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.

  2. 2

    55810 is composite. Its prime factorisation is

    55810=2×5×558155810 = 2 \times 5 \times 5581
  3. 3

    The divisors add up to 100476; without 55810 itself that is 44666, so 55810 is deficient (44666 is less than 55810). Euler's totient φ(55810) = 22320 numbers up to 55810 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 55810 = 2 \times 5 \times 5581 \]

55810 at a glance

PropertyValue
Typecomposite
Number of divisors8
Sum of divisors100476
Euler totient φ(n)22320
Square3114756100
Cube173834537941000
Square root236.241402
Digit sum / digital root19 / 1
Collatz steps to 1184
Scientific notation5.581 × 10410^{4}

55810 in other forms

FormValue
In wordsfifty-five thousand eight hundred and ten
Binary (base 2)1101101000000010
Octal (base 8)155002
Hexadecimal (base 16)DA02
Base 32211120001
As time55810 seconds = 15 h 30 min 10 s

Is 55810 divisible by 2 to 12?

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

Questions

Is 55810 a prime number?

No. 55810 = 2 × 5 × 5581, so it is divisible by 2.

What are the factors of 55810?

1, 2, 5, 10, 5581, 11162, 27905, 55810.

What is 55810 in binary?

1101101000000010 (hexadecimal DA02, octal 155002).

What is the square root of 55810?

About 236.2414.

Is 55810 divisible by 3?

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

What is special about the number 55810?

It is a composite number with 8 divisors.

Find the next one

Nearby numbers

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