WordGPT

The number 48331

48331 is a composite number with 4 divisors. Its prime factorisation is 17 × 2843. Divisors (4): 1, 17, 2843, 48331.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 48331: a semiprime: 17 × 2843, the product of two primes.

  2. 2

    48331 is composite. Its prime factorisation is

    48331=17×284348331 = 17 \times 2843
  3. 3

    The divisors add up to 51192; without 48331 itself that is 2861, so 48331 is deficient (2861 is less than 48331). Euler's totient φ(48331) = 45472 numbers up to 48331 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 48331 = 17 \times 2843 \]

48331 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors51192
Euler totient φ(n)45472
Square2335885561
Cube112895685048691
Square root219.843126
Digit sum / digital root19 / 1
Collatz steps to 1189
Scientific notation4.8331 × 10410^{4}

48331 in other forms

FormValue
In wordsforty-eight thousand three hundred and thirty-one
Binary (base 2)1011110011001011
Octal (base 8)136313
Hexadecimal (base 16)BCCB
Base 32110022001
As time48331 seconds = 13 h 25 min 31 s

Is 48331 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 1)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 3)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 3)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.
10No (remainder 1)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 7)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 48331 a prime number?

No. 48331 = 17 × 2843, so it is divisible by 17.

What are the factors of 48331?

1, 17, 2843, 48331.

What is 48331 in binary?

1011110011001011 (hexadecimal BCCB, octal 136313).

What is the square root of 48331?

About 219.8431.

Is 48331 divisible by 3?

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

What is special about the number 48331?

48331 is a semiprime: 17 × 2843, the product of two primes.

Find the next one

Nearby numbers

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