550011

550,011 (five hundred fifty thousand eleven) is an odd six-digits composite number following 550010 and preceding 550012. In scientific notation, it is written as 5.50011 × 105. The sum of its digits is 12. It has a total of 4 prime factors and 16 positive divisors. There are 285,600 positive integers (up to 550011) that are relatively prime to 550011.

Basic properties

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

Name

Short name 550 thousand 11 five hundred fifty thousand eleven

Notation

Scientific notation 5.50011 × 105 550.011 × 103

Prime Factorization of 550011

Prime Factorization 3 × 7 × 11 × 2381

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

Divisors of 550011

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) 914688 Sum of all the positive divisors of n s(n) 364677 Sum of the proper positive divisors of n A(n) 57168 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 741.627 Returns the nth root of the product of n divisors H(n) 9.62096 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 550,011 can be divided by 16 positive divisors (out of which 0 are even, and 16 are odd). The sum of these divisors (counting 550,011) is 914,688, the average is 57,168.

Other Arithmetic Functions (n = 550011)

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

Divisibility of 550011

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

The number 550,011 is divisible by 3 and 7.

Classification of 550011

• Arithmetic
• Deficient

• Polite

• Square Free

Other numbers

• LucasCarmichael

Base conversion (550011)

Base System Value
2 Binary 10000110010001111011
3 Ternary 1000221110210
4 Quaternary 2012101323
5 Quinary 120100021
6 Senary 15442203
8 Octal 2062173
10 Decimal 550011
12 Duodecimal 226363
16 Hexadecimal 8647b
20 Vigesimal 38f0b
36 Base36 bse3

Basic calculations (n = 550011)

Multiplication

n×i
 n×2 1100022 1650033 2200044 2750055

Division

ni
 n⁄2 275006 183337 137503 110002

Exponentiation

ni
 n2 302512100121 166384982699651331 91513570719617928214641 50333470545067776315262911051

Nth Root

i√n
 2√n 741.627 81.9327 27.2328 14.0629

550011 as geometric shapes

Circle

Radius = n
 Diameter 1.10002e+06 3.45582e+06 9.5037e+11

Sphere

Radius = n
 Volume 6.96952e+17 3.80148e+12 3.45582e+06

Square

Length = n
 Perimeter 2.20004e+06 3.02512e+11 777833

Cube

Length = n
 Surface area 1.81507e+12 1.66385e+17 952647

Equilateral Triangle

Length = n
 Perimeter 1.65003e+06 1.30992e+11 476323

Triangular Pyramid

Length = n
 Surface area 5.23966e+11 1.96087e+16 449082

Cryptographic Hash Functions

md5 b812504043f95d62f3272d469789081a 36acb693e7c08d3dc1d5a1497f1c018a48acbc62 6f667d6d4535a879a40ac90c79ebb64110eaf21e8c3b7fd75864b0906a734b62 8c3c1e950db6abf61db84e70a0c84644ed447ea74b8d2fd9d2ddb1423dc35d9d5c3937fb0e9ec80e7273ba6a390c3e8955f2f2497182e17ede8f9dcbf0f05319 c3e06c91f3280b0ec22d0f0456cb6c20fe2a6354
{"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/550011", "fetch_time": 1624267242000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-25/segments/1623488269939.53/warc/CC-MAIN-20210621085922-20210621115922-00327.warc.gz", "warc_record_offset": 346809152, "warc_record_length": 10981, "token_count": 1471, "char_count": 4164, "score": 3.703125, "int_score": 4, "crawl": "CC-MAIN-2021-25", "snapshot_type": "latest", "language": "en", "language_score": 0.8087246417999268, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00012-of-00064.parquet"}