WordGPT

The number 55703

55703 is a composite number with 4 divisors. Its prime factorisation is 53 × 1051. Divisors (4): 1, 53, 1051, 55703.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 55703: a semiprime: 53 × 1051, the product of two primes.

  2. 2

    55703 is composite. Its prime factorisation is

    55703=53×105155703 = 53 \times 1051
  3. 3

    The divisors add up to 56808; without 55703 itself that is 1105, so 55703 is deficient (1105 is less than 55703). Euler's totient φ(55703) = 54600 numbers up to 55703 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 55703 = 53 \times 1051 \]

55703 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors56808
Euler totient φ(n)54600
Square3102824209
Cube172836616913927
Square root236.014830
Digit sum / digital root20 / 2
Collatz steps to 165
Scientific notation5.5703 × 10410^{4}

55703 in other forms

FormValue
In wordsfifty-five thousand seven hundred and three
Binary (base 2)1101100110010111
Octal (base 8)154627
Hexadecimal (base 16)D997
Base 32211102002
As time55703 seconds = 15 h 28 min 23 s

Is 55703 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 3)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 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 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 3)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 55703 a prime number?

No. 55703 = 53 × 1051, so it is divisible by 53.

What are the factors of 55703?

1, 53, 1051, 55703.

What is 55703 in binary?

1101100110010111 (hexadecimal D997, octal 154627).

What is the square root of 55703?

About 236.0148.

Is 55703 divisible by 3?

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

What is special about the number 55703?

55703 is a semiprime: 53 × 1051, the product of two primes.

Find the next one

Nearby numbers

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