WordGPT

The number 50146

50146 is a composite number with 4 divisors. Its prime factorisation is 2 × 25073. Divisors (4): 1, 2, 25073, 50146.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 50146: a semiprime: 2 × 25073, the product of two primes.

  2. 2

    50146 is composite. Its prime factorisation is

    50146=2×2507350146 = 2 \times 25073
  3. 3

    The divisors add up to 75222; without 50146 itself that is 25076, so 50146 is deficient (25076 is less than 50146). Euler's totient φ(50146) = 25072 numbers up to 50146 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 50146 = 2 \times 25073 \]

50146 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors75222
Euler totient φ(n)25072
Square2514621316
Cube126098200512136
Square root223.933026
Digit sum / digital root16 / 7
Collatz steps to 1127
Scientific notation5.0146 × 10410^{4}

50146 in other forms

FormValue
In wordsfifty thousand one hundred and forty-six
Binary (base 2)1100001111100010
Octal (base 8)141742
Hexadecimal (base 16)C3E2
Base 32112210021
As time50146 seconds = 13 h 55 min 46 s

Is 50146 divisible by 2 to 12?

DivisorAnswerRule
2Yes (50146 ÷ 2 = 25073)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 2)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 4)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (remainder 5)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 2)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 7)A number is divisible by 9 if the digits add up to a multiple of 9.
10No (remainder 6)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 10)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 50146 a prime number?

No. 50146 = 2 × 25073, so it is divisible by 2.

What are the factors of 50146?

1, 2, 25073, 50146.

What is 50146 in binary?

1100001111100010 (hexadecimal C3E2, octal 141742).

What is the square root of 50146?

About 223.9330.

Is 50146 divisible by 3?

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

What is special about the number 50146?

50146 is a semiprime: 2 × 25073, the product of two primes.

Find the next one

Nearby numbers

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