## 550281

550,281 (five hundred fifty thousand two hundred eighty-one) is an odd six-digits composite number following 550280 and preceding 550282. In scientific notation, it is written as 5.50281 × 105. The sum of its digits is 21. It has a total of 4 prime factors and 16 positive divisors. There are 345,600 positive integers (up to 550281) that are relatively prime to 550281.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 6
• Sum of Digits 21
• Digital Root 3

## Name

Short name 550 thousand 281 five hundred fifty thousand two hundred eighty-one

## Notation

Scientific notation 5.50281 × 105 550.281 × 103

## Prime Factorization of 550281

Prime Factorization 3 × 31 × 61 × 97

Composite number
Distinct Factors Total Factors Radical ω(n) 4 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 550281 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 550,281 is 3 × 31 × 61 × 97. Since it has a total of 4 prime factors, 550,281 is a composite number.

## Divisors of 550281

16 divisors

 Even divisors 0 16 8 8
Total Divisors Sum of Divisors Aliquot Sum τ(n) 16 Total number of the positive divisors of n σ(n) 777728 Sum of all the positive divisors of n s(n) 227447 Sum of the proper positive divisors of n A(n) 48608 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 741.809 Returns the nth root of the product of n divisors H(n) 11.3208 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 550,281 can be divided by 16 positive divisors (out of which 0 are even, and 16 are odd). The sum of these divisors (counting 550,281) is 777,728, the average is 48,608.

## Other Arithmetic Functions (n = 550281)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 345600 Total number of positive integers not greater than n that are coprime to n λ(n) 480 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 45234 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 345,600 positive integers (less than 550,281) that are coprime with 550,281. And there are approximately 45,234 prime numbers less than or equal to 550,281.

## Divisibility of 550281

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

The number 550,281 is divisible by 3.

## Classification of 550281

• Arithmetic
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (550281)

Base System Value
2 Binary 10000110010110001001
3 Ternary 1000221211210
4 Quaternary 2012112021
5 Quinary 120102111
6 Senary 15443333
8 Octal 2062611
10 Decimal 550281
12 Duodecimal 226549
16 Hexadecimal 86589
20 Vigesimal 38fe1
36 Base36 bsll

## Basic calculations (n = 550281)

### Multiplication

n×i
 n×2 1100562 1650843 2201124 2751405

### Division

ni
 n⁄2 275140 183427 137570 110056

### Exponentiation

ni
 n2 302809178961 166630137807838041 91693398863034925039521 50457135219749721585672655401

### Nth Root

i√n
 2√n 741.809 81.9461 27.2362 14.0643

## 550281 as geometric shapes

### Circle

Radius = n
 Diameter 1.10056e+06 3.45752e+06 9.51303e+11

### Sphere

Radius = n
 Volume 6.97979e+17 3.80521e+12 3.45752e+06

### Square

Length = n
 Perimeter 2.20112e+06 3.02809e+11 778215

### Cube

Length = n
 Surface area 1.81686e+12 1.6663e+17 953115

### Equilateral Triangle

Length = n
 Perimeter 1.65084e+06 1.3112e+11 476557

### Triangular Pyramid

Length = n
 Surface area 5.24481e+11 1.96376e+16 449303

## Cryptographic Hash Functions

md5 d42ae92b845980e4717281a1b34afb5f a296414bf59e013be4c75beabec09aedd3f46b65 7d829aa3374168fb733b89cb16ba80e3a1c3564ab116697d8575b60c1017ee4b 362b0c9e46e01b250b2c1228a9d4ef9c62012390b9f33e0c2cc4405c57540f7ca200bed4cdaee8a74b52c984c78c73be08a7ab19ee6e3a15077dcda345d6e7aa b8b18e7aaf159812edb3095ea9a61b67b32cb19d
{"ft_lang_label":"__label__en","ft_lang_prob":0.6014493,"math_prob":0.9859852,"size":4650,"snap":"2021-21-2021-25","text_gpt3_token_len":1632,"char_repetition_ratio":0.11902712,"word_repetition_ratio":0.03665689,"special_character_ratio":0.46215054,"punctuation_ratio":0.07564103,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9965992,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-23T14:02:37Z\",\"WARC-Record-ID\":\"<urn:uuid:8f72caba-8f04-4ac0-ba4c-f2f8d09fc397>\",\"Content-Length\":\"60306\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:760fe981-697d-4119-aeca-ee339e9e56e0>\",\"WARC-Concurrent-To\":\"<urn:uuid:28330c06-0794-44e5-aada-6590ab263a1c>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/550281\",\"WARC-Payload-Digest\":\"sha1:SWGTH7DKRGDYPPNGLLPGHDQ3NBVHCOKF\",\"WARC-Block-Digest\":\"sha1:4P6ZDKRJ3ZCVKCQSEV4WPE67ISEQGLYB\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623488539480.67_warc_CC-MAIN-20210623134306-20210623164306-00546.warc.gz\"}"}