WordGPT

The number 49505

49505 is a composite number with 4 divisors. Its prime factorisation is 5 × 9901. Divisors (4): 1, 5, 9901, 49505.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 49505: a semiprime: 5 × 9901, the product of two primes.

  2. 2

    49505 is composite. Its prime factorisation is

    49505=5×990149505 = 5 \times 9901
  3. 3

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

  4. 4

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

LaTeX source of the formulas on this page
\[ 49505 = 5 \times 9901 \]

49505 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors59412
Euler totient φ(n)39600
Square2450745025
Cube121324132462625
Square root222.497191
Digit sum / digital root23 / 5
Collatz steps to 170
Scientific notation4.9505 × 10410^{4}

49505 in other forms

FormValue
In wordsforty-nine thousand five hundred and five
Binary (base 2)1100000101100001
Octal (base 8)140541
Hexadecimal (base 16)C161
Base 32111220112
As time49505 seconds = 13 h 45 min 5 s

Is 49505 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 1)A number is divisible by 4 if the last two digits make a multiple of 4.
5Yes (49505 ÷ 5 = 9901)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 1)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 5)A number is divisible by 9 if the digits add up to a multiple of 9.
10No (remainder 5)A number is divisible by 10 if the last digit is 0.
11No (remainder 5)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 5)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 49505 a prime number?

No. 49505 = 5 × 9901, so it is divisible by 5.

What are the factors of 49505?

1, 5, 9901, 49505.

What is 49505 in binary?

1100000101100001 (hexadecimal C161, octal 140541).

What is the square root of 49505?

About 222.4972.

Is 49505 divisible by 3?

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

What is special about the number 49505?

49505 is a semiprime: 5 × 9901, the product of two primes.

Find the next one

Nearby numbers

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