## 550605

550,605 (five hundred fifty thousand six hundred five) is an odd six-digits composite number following 550604 and preceding 550606. In scientific notation, it is written as 5.50605 × 105. The sum of its digits is 21. It has a total of 5 prime factors and 32 positive divisors. There are 257,600 positive integers (up to 550605) that are relatively prime to 550605.

## Basic properties

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

## Name

Short name 550 thousand 605 five hundred fifty thousand six hundred five

## Notation

Scientific notation 5.50605 × 105 550.605 × 103

## Prime Factorization of 550605

Prime Factorization 3 × 5 × 11 × 47 × 71

Composite number
Distinct Factors Total Factors Radical ω(n) 5 Total number of distinct prime factors Ω(n) 5 Total number of prime factors rad(n) 550605 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,605 is 3 × 5 × 11 × 47 × 71. Since it has a total of 5 prime factors, 550,605 is a composite number.

## Divisors of 550605

32 divisors

 Even divisors 0 32 16 16
Total Divisors Sum of Divisors Aliquot Sum τ(n) 32 Total number of the positive divisors of n σ(n) 995328 Sum of all the positive divisors of n s(n) 444723 Sum of the proper positive divisors of n A(n) 31104 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 742.028 Returns the nth root of the product of n divisors H(n) 17.7021 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 550,605 can be divided by 32 positive divisors (out of which 0 are even, and 32 are odd). The sum of these divisors (counting 550,605) is 995,328, the average is 31,104.

## Other Arithmetic Functions (n = 550605)

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

## Divisibility of 550605

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

The number 550,605 is divisible by 3 and 5.

## Classification of 550605

• Arithmetic
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (550605)

Base System Value
2 Binary 10000110011011001101
3 Ternary 1000222021210
4 Quaternary 2012123031
5 Quinary 120104410
6 Senary 15445033
8 Octal 2063315
10 Decimal 550605
12 Duodecimal 226779
20 Vigesimal 38ga5
36 Base36 bsul

## Basic calculations (n = 550605)

### Multiplication

n×i
 n×2 1101210 1651815 2202420 2753025

### Division

ni
 n⁄2 275302 183535 137651 110121

### Exponentiation

ni
 n2 303165866025 166924641662695125 91909542322688249300625 50605853550583763506170628125

### Nth Root

i√n
 2√n 742.028 81.9622 27.2402 14.0659

## 550605 as geometric shapes

### Circle

 Diameter 1.10121e+06 3.45955e+06 9.52424e+11

### Sphere

 Volume 6.99212e+17 3.80969e+12 3.45955e+06

### Square

Length = n
 Perimeter 2.20242e+06 3.03166e+11 778673

### Cube

Length = n
 Surface area 1.819e+12 1.66925e+17 953676

### Equilateral Triangle

Length = n
 Perimeter 1.65182e+06 1.31275e+11 476838

### Triangular Pyramid

Length = n
 Surface area 5.25099e+11 1.96723e+16 449567

## Cryptographic Hash Functions

md5 3f63d5bdbea9160e481bebaa88ca62c0 1fa3c925755b7c933b933cb8595a6f94a91c8a10 ab17cf35ebfffa243d04a921ecb66c6e63c05e3e7930c3b521874cc7cdc6d9a5 9634b0a3f4d3ee6c2dfa8bba52b251990b1a09a06d0f3ea6308a6a2fcee6ba5365444011077c1534e0c78314433c225ba61c5395238ac424ce831a3911da2816 e8f4b2aa48950663fd5b05e8f3b2561681a24c1f
{"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, "url": "https://metanumbers.com/550605", "fetch_time": 1623740836000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-25/segments/1623487617599.15/warc/CC-MAIN-20210615053457-20210615083457-00306.warc.gz", "warc_record_offset": 367841441, "warc_record_length": 7676, "token_count": 1484, "char_count": 4234, "score": 3.6875, "int_score": 4, "crawl": "CC-MAIN-2021-25", "snapshot_type": "latest", "language": "en", "language_score": 0.8061760067939758, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00019-of-00064.parquet"}