WordGPT

The number 48791

48791 is a composite number with 4 divisors. Its prime factorisation is 97 × 503. Divisors (4): 1, 97, 503, 48791.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 48791: a semiprime: 97 × 503, the product of two primes.

  2. 2

    48791 is composite. Its prime factorisation is

    48791=97×50348791 = 97 \times 503
  3. 3

    The divisors add up to 49392; without 48791 itself that is 601, so 48791 is deficient (601 is less than 48791). Euler's totient φ(48791) = 48192 numbers up to 48791 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 48791 = 97 \times 503 \]

48791 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors49392
Euler totient φ(n)48192
Square2380561681
Cube116149984977671
Square root220.886849
Digit sum / digital root29 / 2
Collatz steps to 139
Scientific notation4.8791 × 10410^{4}

48791 in other forms

FormValue
In wordsforty-eight thousand seven hundred and ninety-one
Binary (base 2)1011111010010111
Octal (base 8)137227
Hexadecimal (base 16)BE97
Base 32110221002
As time48791 seconds = 13 h 33 min 11 s

Is 48791 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 1)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 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 2)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 6)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 48791 a prime number?

No. 48791 = 97 × 503, so it is divisible by 97.

What are the factors of 48791?

1, 97, 503, 48791.

What is 48791 in binary?

1011111010010111 (hexadecimal BE97, octal 137227).

What is the square root of 48791?

About 220.8868.

Is 48791 divisible by 3?

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

What is special about the number 48791?

48791 is a semiprime: 97 × 503, the product of two primes.

Find the next one

Nearby numbers

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