# 50490 (number)

50,490 (fifty thousand four hundred ninety) is an even five-digits composite number following 50489 and preceding 50491. In scientific notation, it is written as 5.049 × 104. The sum of its digits is 18. It has a total of 7 prime factors and 64 positive divisors. There are 11,520 positive integers (up to 50490) that are relatively prime to 50490.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 5
• Sum of Digits 18
• Digital Root 9

## Name

Short name 50 thousand 490 fifty thousand four hundred ninety

## Notation

Scientific notation 5.049 × 104 50.49 × 103

## Prime Factorization of 50490

Prime Factorization 2 × 33 × 5 × 11 × 17

Composite number
Distinct Factors Total Factors Radical ω(n) 5 Total number of distinct prime factors Ω(n) 7 Total number of prime factors rad(n) 5610 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 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,490 is 2 × 33 × 5 × 11 × 17. Since it has a total of 7 prime factors, 50,490 is a composite number.

## Divisors of 50490

1, 2, 3, 5, 6, 9, 10, 11, 15, 17, 18, 22, 27, 30, 33, 34, 45, 51, 54, 55, 66, 85, 90, 99, 102, 110, 135, 153, 165, 170, 187, 198, 255, 270, 297, 306, 330, 374, 459, 495, 510, 561, 594, 765, 918, 990, 1485, 1530, 2295, 2970, 4590 Load all the 64 divisors

64 divisors

 Even divisors 32 32 16 16
Total Divisors Sum of Divisors Aliquot Sum τ(n) 64 Total number of the positive divisors of n σ(n) 155520 Sum of all the positive divisors of n s(n) 105030 Sum of the proper positive divisors of n A(n) 2430 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 224.7 Returns the nth root of the product of n divisors H(n) 20.7778 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 50,490 can be divided by 64 positive divisors (out of which 32 are even, and 32 are odd). The sum of these divisors (counting 50,490) is 155,520, the average is 2,430.

## Other Arithmetic Functions (n = 50490)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 11520 Total number of positive integers not greater than n that are coprime to n λ(n) 720 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 5175 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 11,520 positive integers (less than 50,490) that are coprime with 50,490. And there are approximately 5,175 prime numbers less than or equal to 50,490.

## Divisibility of 50490

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

The number 50,490 is divisible by 2, 3, 5, 6 and 9.

• Arithmetic
• Abundant

• Polite
• Practical

## Base conversion (50490)

Base System Value
2 Binary 1100010100111010
3 Ternary 2120021000
4 Quaternary 30110322
5 Quinary 3103430
6 Senary 1025430
8 Octal 142472
10 Decimal 50490
12 Duodecimal 25276
20 Vigesimal 664a
36 Base36 12yi

## Basic calculations (n = 50490)

### Multiplication

n×y
 n×2 100980 151470 201960 252450

### Division

n÷y
 n÷2 25245 16830 12622.5 10098

### Exponentiation

ny
 n2 2549240100 128711132649000 6498625087448010000 328115580665250024900000

### Nth Root

y√n
 2√n 224.7 36.9603 14.99 8.7225

## 50490 as geometric shapes

### Circle

 Diameter 100980 317238 8.00867e+09

### Sphere

 Volume 5.39144e+14 3.20347e+10 317238

### Square

Length = n
 Perimeter 201960 2.54924e+09 71403.6

### Cube

Length = n
 Surface area 1.52954e+10 1.28711e+14 87451.2

### Equilateral Triangle

Length = n
 Perimeter 151470 1.10385e+09 43725.6

### Triangular Pyramid

Length = n
 Surface area 4.41541e+09 1.51688e+13 41224.9

## Cryptographic Hash Functions

md5 71d85662a2df87a0f5c7b88db4587969 381f433322cec064b0a1e46a3f59cea2ce928e46 cc0145fdb56f49caf2072e983dd746d178f55f0d6a041dcf41fceef08774d7ab d81f393c6271978a67c20a1d2a62084e62fc6dfd2029c87757f73875a6cc3005e86508e7dfd59faeb3e920b3ebc82393a44d266bdd020bedb14f31379334f9bf 300a09e9a5c2b0ed77549fda639a0e11bdba31b8
{"ft_lang_label":"__label__en","ft_lang_prob":0.6205344,"math_prob":0.98770535,"size":4525,"snap":"2021-43-2021-49","text_gpt3_token_len":1614,"char_repetition_ratio":0.11966379,"word_repetition_ratio":0.03671072,"special_character_ratio":0.45812154,"punctuation_ratio":0.07830552,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9943045,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-22T21:41:06Z\",\"WARC-Record-ID\":\"<urn:uuid:cac10642-ff6a-4c48-98ed-68cfe37bf479>\",\"Content-Length\":\"40523\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:001792ed-9ac8-4869-ad3f-a325d1448213>\",\"WARC-Concurrent-To\":\"<urn:uuid:ece92ce1-29a1-4ce1-9570-95b71b6dc418>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/50490\",\"WARC-Payload-Digest\":\"sha1:PGZGMXPFSIATMUAOTUVQYJLABM6JHIJF\",\"WARC-Block-Digest\":\"sha1:I5XLUVOA6XNGP4W4ZIXWIMA7R4QDTM26\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585522.78_warc_CC-MAIN-20211022212051-20211023002051-00345.warc.gz\"}"}