WordGPT

The number 48763

48763 is a composite number with 12 divisors. Its prime factorisation is 11211^{2} × 13 × 31. Divisors (12): 1, 11, 13, 31, 121, 143, 341, 403, 1573, 3751, 4433, 48763.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    48763 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.

  2. 2

    48763 is composite. Its prime factorisation is

    48763=112×13×3148763 = 11^{2} \times 13 \times 31
  3. 3

    The divisors add up to 59584; without 48763 itself that is 10821, so 48763 is deficient (10821 is less than 48763). Euler's totient φ(48763) = 39600 numbers up to 48763 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 48763 = 11^{2} \times 13 \times 31 \]

48763 at a glance

PropertyValue
Typecomposite
Number of divisors12
Sum of divisors59584
Euler totient φ(n)39600
Square2377830169
Cube115950132530947
Square root220.823459 (= 11√403)
Digit sum / digital root28 / 1
Collatz steps to 165
Scientific notation4.8763 × 10410^{4}

48763 in other forms

FormValue
In wordsforty-eight thousand seven hundred and sixty-three
Binary (base 2)1011111001111011
Octal (base 8)137173
Hexadecimal (base 16)BE7B
Base 32110220001
As time48763 seconds = 13 h 32 min 43 s

Is 48763 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 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 3)A number is divisible by 10 if the last digit is 0.
11Yes (48763 ÷ 11 = 4433)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 48763 a prime number?

No. 48763 = 11211^{2} × 13 × 31, so it is divisible by 11.

What are the factors of 48763?

1, 11, 13, 31, 121, 143, 341, 403, 1573, 3751, 4433, 48763.

What is 48763 in binary?

1011111001111011 (hexadecimal BE7B, octal 137173).

What is the square root of 48763?

About 220.8235, exactly 11√403.

Is 48763 divisible by 3?

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

What is special about the number 48763?

It is a composite number with 12 divisors.

Find the next one

Nearby numbers

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