WordGPT

The number 48511

48511 is a composite number with 4 divisors. Its prime factorisation is 139 × 349. Divisors (4): 1, 139, 349, 48511.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 48511: a semiprime: 139 × 349, the product of two primes.

  2. 2

    48511 is composite. Its prime factorisation is

    48511=139×34948511 = 139 \times 349
  3. 3

    The divisors add up to 49000; without 48511 itself that is 489, so 48511 is deficient (489 is less than 48511). Euler's totient φ(48511) = 48024 numbers up to 48511 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 48511 = 139 \times 349 \]

48511 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors49000
Euler totient φ(n)48024
Square2353317121
Cube114161766856831
Square root220.252128
Digit sum / digital root19 / 1
Collatz steps to 183
Scientific notation4.8511 × 10410^{4}

48511 in other forms

FormValue
In wordsforty-eight thousand five hundred and eleven
Binary (base 2)1011110101111111
Octal (base 8)136577
Hexadecimal (base 16)BD7F
Base 32110112201
As time48511 seconds = 13 h 28 min 31 s

Is 48511 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 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 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 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 48511 a prime number?

No. 48511 = 139 × 349, so it is divisible by 139.

What are the factors of 48511?

1, 139, 349, 48511.

What is 48511 in binary?

1011110101111111 (hexadecimal BD7F, octal 136577).

What is the square root of 48511?

About 220.2521.

Is 48511 divisible by 3?

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

What is special about the number 48511?

48511 is a semiprime: 139 × 349, the product of two primes.

Find the next one

Nearby numbers

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