WordGPT

The number 48903

48903 is a composite number with 4 divisors. Its prime factorisation is 3 × 16301. Divisors (4): 1, 3, 16301, 48903.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 48903: a semiprime: 3 × 16301, the product of two primes.

  2. 2

    48903 is composite. Its prime factorisation is

    48903=3×1630148903 = 3 \times 16301
  3. 3

    The divisors add up to 65208; without 48903 itself that is 16305, so 48903 is deficient (16305 is less than 48903). Euler's totient φ(48903) = 32600 numbers up to 48903 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 48903 = 3 \times 16301 \]

48903 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors65208
Euler totient φ(n)32600
Square2391503409
Cube116951691210327
Square root221.140227
Digit sum / digital root24 / 6
Collatz steps to 139
Scientific notation4.8903 × 10410^{4}

48903 in other forms

FormValue
In wordsforty-eight thousand nine hundred and three
Binary (base 2)1011111100000111
Octal (base 8)137407
Hexadecimal (base 16)BF07
Base 32111002020
As time48903 seconds = 13 h 35 min 3 s

Is 48903 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).
3Yes (48903 ÷ 3 = 16301)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 3)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 6)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 8)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 3)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 48903 a prime number?

No. 48903 = 3 × 16301, so it is divisible by 3.

What are the factors of 48903?

1, 3, 16301, 48903.

What is 48903 in binary?

1011111100000111 (hexadecimal BF07, octal 137407).

What is the square root of 48903?

About 221.1402.

Is 48903 divisible by 3?

Yes. Its digits add up to 24, a multiple of 3.

What is special about the number 48903?

48903 is a semiprime: 3 × 16301, the product of two primes.

Find the next one

Nearby numbers

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