text: # 1022057 (number)
  
  1,022,057 (one million twenty-two thousand fifty-seven) is an odd seven-digits composite number following 1022056 and preceding 1022058. In scientific notation, it is written as 1.022057 × 106. The sum of its digits is 17. It has a total of 3 prime factors and 8 positive divisors. There are 944,704 positive integers (up to 1022057) that are relatively prime to 1022057.
  
  ## Basic properties
  
  • Is Prime? No
  • Number parity Odd
  • Number length 7
  • Sum of Digits 17
  • Digital Root 8
  
  ## Name
  
  Short name 1 million 22 thousand 57 one million twenty-two thousand fifty-seven
  
  ## Notation
  
  Scientific notation 1.022057 × 106 1.022057 × 106
  
  ## Prime Factorization of 1022057
  
  Prime Factorization 17 × 59 × 1019
  
  Composite number
  Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 1022057 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 1,022,057 is 17 × 59 × 1019. Since it has a total of 3 prime factors, 1,022,057 is a composite number.
  
  ## Divisors of 1022057
  
  8 divisors
  
   Even divisors 0 8 4 4
  Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 1.1016e+06 Sum of all the positive divisors of n s(n) 79543 Sum of the proper positive divisors of n A(n) 137700 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 1010.97 Returns the nth root of the product of n divisors H(n) 7.42235 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors
  
  The number 1,022,057 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 1,022,057) is 1,101,600, the average is 137,700.
  
  ## Other Arithmetic Functions (n = 1022057)
  
  1 φ(n) n
  Euler Totient Carmichael Lambda Prime Pi φ(n) 944704 Total number of positive integers not greater than n that are coprime to n λ(n) 236176 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 79936 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 944,704 positive integers (less than 1,022,057) that are coprime with 1,022,057. And there are approximately 79,936 prime numbers less than or equal to 1,022,057.
  
  ## Divisibility of 1022057
  
   m n mod m 2 3 4 5 6 7 8 9 1 2 1 2 5 1 1 8
  
  1,022,057 is not divisible by any number less than or equal to 9.
  
  ## Classification of 1022057
  
  • Arithmetic
  • Deficient
  
  • Polite
  
  • Square Free
  
  ### Other numbers
  
  • LucasCarmichael
  • Sphenic
  
  ## Base conversion (1022057)
  
  Base System Value
  2 Binary 11111001100001101001
  3 Ternary 1220220222222
  4 Quaternary 3321201221
  5 Quinary 230201212
  6 Senary 33523425
  8 Octal 3714151
  10 Decimal 1022057
  12 Duodecimal 413575
  20 Vigesimal 67f2h
  36 Base36 lwmh
  
  ## Basic calculations (n = 1022057)
  
  ### Multiplication
  
  n×y
   n×2 2044114 3066171 4088228 5110285
  
  ### Division
  
  n÷y
   n÷2 511028 340686 255514 204411
  
  ### Exponentiation
  
  ny
   n2 1044600511249 1067641264725619193 1091190228101672175540001 1115258610962910758715886802057
  
  ### Nth Root
  
  y√n
   2√n 1010.97 100.73 31.7957 15.9182
  
  ## 1022057 as geometric shapes
  
  ### Circle
  
   Diameter 2.04411e+06 6.42177e+06 3.28171e+12
  
  ### Sphere
  
   Volume 4.47213e+18 1.31268e+13 6.42177e+06
  
  ### Square
  
  Length = n
   Perimeter 4.08823e+06 1.0446e+12 1.44541e+06
  
  ### Cube
  
  Length = n
   Surface area 6.2676e+12 1.06764e+18 1.77025e+06
  
  ### Equilateral Triangle
  
  Length = n
   Perimeter 3.06617e+06 4.52325e+11 885127
  
  ### Triangular Pyramid
  
  Length = n
   Surface area 1.8093e+12 1.25823e+17 834506
  
  ## Cryptographic Hash Functions
  
  md5 2f93719188848c1c1cec14525d2ccc5b dedc634f01b81120e4e64654c784756875282446 5ce48dcc9d7cf81fde1d86148e49f4bee0618c1ad8c09637bd34a0e5c0bb424b d7cff5b8556bc65a41d2a2d557f26fd141821fcb750595d1e341ff8193a4b341a05f78259ba5ef61c96fd77ca173e5bc9a5bdf5d25ae3241a282bff33834f7b6 ab3fc5f6f120f0a2b2f930662efa0d97ab0dab41