## 50282

50,282 (fifty thousand two hundred eighty-two) is an even five-digits composite number following 50281 and preceding 50283. In scientific notation, it is written as 5.0282 × 104. The sum of its digits is 17. It has a total of 3 prime factors and 8 positive divisors. There are 24,300 positive integers (up to 50282) that are relatively prime to 50282.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 5
• Sum of Digits 17
• Digital Root 8

## Name

Short name 50 thousand 282 fifty thousand two hundred eighty-two

## Notation

Scientific notation 5.0282 × 104 50.282 × 103

## Prime Factorization of 50282

Prime Factorization 2 × 31 × 811

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 50282 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) -1 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 0 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 50,282 is 2 × 31 × 811. Since it has a total of 3 prime factors, 50,282 is a composite number.

## Divisors of 50282

1, 2, 31, 62, 811, 1622, 25141, 50282

8 divisors

 Even divisors 4 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 77952 Sum of all the positive divisors of n s(n) 27670 Sum of the proper positive divisors of n A(n) 9744 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 224.236 Returns the nth root of the product of n divisors H(n) 5.1603 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 50,282 can be divided by 8 positive divisors (out of which 4 are even, and 4 are odd). The sum of these divisors (counting 50,282) is 77,952, the average is 9,744.

## Other Arithmetic Functions (n = 50282)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 24300 Total number of positive integers not greater than n that are coprime to n λ(n) 810 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 5156 Total number of primes less than or equal to n r2(n) 0 The number of ways n can be represented as the sum of 2 squares

There are 24,300 positive integers (less than 50,282) that are coprime with 50,282. And there are approximately 5,156 prime numbers less than or equal to 50,282.

## Divisibility of 50282

 m n mod m 2 3 4 5 6 7 8 9 0 2 2 2 2 1 2 8

The number 50,282 is divisible by 2.

## Classification of 50282

• Arithmetic
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

• Sphenic

## Base conversion (50282)

Base System Value
2 Binary 1100010001101010
3 Ternary 2112222022
4 Quaternary 30101222
5 Quinary 3102112
6 Senary 1024442
8 Octal 142152
10 Decimal 50282
12 Duodecimal 25122
20 Vigesimal 65e2
36 Base36 12sq

## Basic calculations (n = 50282)

### Multiplication

n×i
 n×2 100564 150846 201128 251410

### Division

ni
 n⁄2 25141 16760.7 12570.5 10056.4

### Exponentiation

ni
 n2 2528279524 127126951025768 6392197351477666576 321412467227000030774432

### Nth Root

i√n
 2√n 224.236 36.9094 14.9745 8.7153

## 50282 as geometric shapes

### Circle

 Diameter 100564 315931 7.94282e+09

### Sphere

 Volume 5.32508e+14 3.17713e+10 315931

### Square

Length = n
 Perimeter 201128 2.52828e+09 71109.5

### Cube

Length = n
 Surface area 1.51697e+10 1.27127e+14 87091

### Equilateral Triangle

Length = n
 Perimeter 150846 1.09478e+09 43545.5

### Triangular Pyramid

Length = n
 Surface area 4.37911e+09 1.49821e+13 41055.1

## Cryptographic Hash Functions

md5 6426551eee37e119b15fc51e52b36c4e 7f9d2f7186166f8a97ac0251cd487bb4f1bc9801 3833170c370689e3894e0a8953bb28c0b2e85ce263c85a2cb2c264a0b6c96b5a 1fdaa39704d1d6c6dfb1a923b5bc1ebb4898136b4e3749788a9bd7b12ce1404c310d4eb7b3dcbbf47338fa1decef6a81147632076d1a965bb74f40a3ca7b3610 f780ed03187577fa724ff0a4b6ccfa89e8c00ecd
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}