WordGPT

The number 55903

55903 is a twin prime (55901 and 55903 are both prime) and the 5675th prime number. Its only divisors are 1 and 55903.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 55903: a twin prime (55901 and 55903 are both prime); the 5675th prime number.

  2. 2

    55903 is prime, so its only factors are 1 and 55903. It is the 5675th prime; the next prime is 55921 and the one before is 55901.

  3. 3

    The divisors add up to 55904; without 55903 itself that is 1, so 55903 is deficient (1 is less than 55903). Euler's totient φ(55903) = 55902 numbers up to 55903 share no factor with it.

  4. 4

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

55903 at a glance

PropertyValue
Typeprime
Number of divisors2
Sum of divisors55904
Euler totient φ(n)55902
Square3125145409
Cube174705003799327
Square root236.438153
Digit sum / digital root22 / 4
Collatz steps to 191
Scientific notation5.5903 × 10410^{4}

55903 in other forms

FormValue
In wordsfifty-five thousand nine hundred and three
Binary (base 2)1101101001011111
Octal (base 8)155137
Hexadecimal (base 16)DA5F
Base 32211200111
As time55903 seconds = 15 h 31 min 43 s

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

Questions

Is 55903 a prime number?

Yes. 55903 is divisible only by 1 and itself.

What are the factors of 55903?

1, 55903.

What is 55903 in binary?

1101101001011111 (hexadecimal DA5F, octal 155137).

What is the square root of 55903?

About 236.4382.

Is 55903 divisible by 3?

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

What is special about the number 55903?

55903 is a twin prime (55901 and 55903 are both prime); the 5675th prime number.

All about 55903

Find the next one

Nearby numbers

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