4021564 (number)

4,021,564 (four million twenty-one thousand five hundred sixty-four) is an even seven-digits composite number following 4021563 and preceding 4021565. In scientific notation, it is written as 4.021564 × 106. The sum of its digits is 22. It has a total of 3 prime factors and 6 positive divisors. There are 2,010,780 positive integers (up to 4021564) that are relatively prime to 4021564.

Basic properties

• Is Prime? No
• Number parity Even
• Number length 7
• Sum of Digits 22
• Digital Root 4

Name

Short name 4 million 21 thousand 564 four million twenty-one thousand five hundred sixty-four

Notation

Scientific notation 4.021564 × 106 4.021564 × 106

Prime Factorization of 4021564

Prime Factorization 22 × 1005391

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 2010782 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 4,021,564 is 22 × 1005391. Since it has a total of 3 prime factors, 4,021,564 is a composite number.

Divisors of 4021564

6 divisors

 Even divisors 4 2 1 1
Total Divisors Sum of Divisors Aliquot Sum τ(n) 6 Total number of the positive divisors of n σ(n) 7.03774e+06 Sum of all the positive divisors of n s(n) 3.01618e+06 Sum of the proper positive divisors of n A(n) 1.17296e+06 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 2005.38 Returns the nth root of the product of n divisors H(n) 3.42857 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 4,021,564 can be divided by 6 positive divisors (out of which 4 are even, and 2 are odd). The sum of these divisors (counting 4,021,564) is 7,037,744, the average is 11,729,57.,333.

Other Arithmetic Functions (n = 4021564)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 2010780 Total number of positive integers not greater than n that are coprime to n λ(n) 1005390 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 284032 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 2,010,780 positive integers (less than 4,021,564) that are coprime with 4,021,564. And there are approximately 284,032 prime numbers less than or equal to 4,021,564.

Divisibility of 4021564

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

The number 4,021,564 is divisible by 2 and 4.

Classification of 4021564

• Deficient

Expressible via specific sums

• Polite
• Non-hypotenuse

Base conversion (4021564)

Base System Value
2 Binary 1111010101110100111100
3 Ternary 21120022112211
4 Quaternary 33111310330
5 Quinary 2012142224
6 Senary 222110204
8 Octal 17256474
10 Decimal 4021564
12 Duodecimal 141b364
20 Vigesimal 152di4
36 Base36 2e724

Basic calculations (n = 4021564)

Multiplication

n×y
 n×2 8043128 12064692 16086256 20107820

Division

n÷y
 n÷2 2.01078e+06 1.34052e+06 1.00539e+06 804313

Exponentiation

ny
 n2 16172977006096 65040662100543454144 261565185239709935621161216 1051901132613348847536379584461824

Nth Root

y√n
 2√n 2005.38 159.025 44.7815 20.9353

4021564 as geometric shapes

Circle

 Diameter 8.04313e+06 2.52682e+07 5.08089e+13

Sphere

 Volume 2.72442e+20 2.03236e+14 2.52682e+07

Square

Length = n
 Perimeter 1.60863e+07 1.6173e+13 5.68735e+06

Cube

Length = n
 Surface area 9.70379e+13 6.50407e+19 6.96555e+06

Equilateral Triangle

Length = n
 Perimeter 1.20647e+07 7.0031e+12 3.48278e+06

Triangular Pyramid

Length = n
 Surface area 2.80124e+13 7.66512e+18 3.28359e+06

Cryptographic Hash Functions

md5 305e5a3905fb7274ef6654ff9fbc51bc 4b6dcac3f74e7fc9a689e308ebabd7112b4248a1 cb58c318fcf21c0ddc228d5c793fa33f3359345d3543d6b21f9afad6ab7c2991 c86b743dba5a9f65fcee7846aca823170bf287ff46ed8eedef4ba6ebf611b7e4377d37a8306a97c16cf8135fdaa2c6c3320e4ab7e2a79a37494c73761e8013e3 73e841215be984dd760002f4662e23e93482f6b5
{"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/4021564", "fetch_time": 1642653564000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2022-05/segments/1642320301720.45/warc/CC-MAIN-20220120035934-20220120065934-00577.warc.gz", "warc_record_offset": 450367185, "warc_record_length": 7409, "token_count": 1552, "char_count": 4292, "score": 3.5625, "int_score": 4, "crawl": "CC-MAIN-2022-05", "snapshot_type": "latest", "language": "en", "language_score": 0.8168657422065735, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00019-of-00064.parquet"}