# 133057 (number)

133,057 (one hundred thirty-three thousand fifty-seven) is an odd six-digits composite number following 133056 and preceding 133058. In scientific notation, it is written as 1.33057 × 105. The sum of its digits is 19. It has a total of 3 prime factors and 8 positive divisors. There are 122,544 positive integers (up to 133057) that are relatively prime to 133057.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 6
• Sum of Digits 19
• Digital Root 1

## Name

Short name 133 thousand 57 one hundred thirty-three thousand fifty-seven

## Notation

Scientific notation 1.33057 × 105 133.057 × 103

## Prime Factorization of 133057

Prime Factorization 19 × 47 × 149

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 133057 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 133,057 is 19 × 47 × 149. Since it has a total of 3 prime factors, 133,057 is a composite number.

## Divisors of 133057

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) 144000 Sum of all the positive divisors of n s(n) 10943 Sum of the proper positive divisors of n A(n) 18000 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 364.77 Returns the nth root of the product of n divisors H(n) 7.39206 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 133,057 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 133,057) is 144,000, the average is 18,000.

## Other Arithmetic Functions (n = 133057)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 122544 Total number of positive integers not greater than n that are coprime to n λ(n) 30636 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 12386 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 122,544 positive integers (less than 133,057) that are coprime with 133,057. And there are approximately 12,386 prime numbers less than or equal to 133,057.

## Divisibility of 133057

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

133,057 is not divisible by any number less than or equal to 9.

## Classification of 133057

• Arithmetic
• Deficient

• Polite

• Pentagonal

• Square Free

### Other numbers

• LucasCarmichael
• Sphenic

## Base conversion (133057)

Base System Value
2 Binary 100000011111000001
3 Ternary 20202112001
4 Quaternary 200133001
5 Quinary 13224212
6 Senary 2504001
8 Octal 403701
10 Decimal 133057
12 Duodecimal 65001
20 Vigesimal gcch
36 Base36 2uo1

## Basic calculations (n = 133057)

### Multiplication

n×y
 n×2 266114 399171 532228 665285

### Division

n÷y
 n÷2 66528.5 44352.3 33264.2 26611.4

### Exponentiation

ny
 n2 17704165249 2355663115536193 313437467163899232001 41705049068426940112357057

### Nth Root

y√n
 2√n 364.77 51.052 19.0989 10.5878

## 133057 as geometric shapes

### Circle

 Diameter 266114 836022 5.56193e+10

### Sphere

 Volume 9.86738e+15 2.22477e+11 836022

### Square

Length = n
 Perimeter 532228 1.77042e+10 188171

### Cube

Length = n
 Surface area 1.06225e+11 2.35566e+15 230461

### Equilateral Triangle

Length = n
 Perimeter 399171 7.66613e+09 115231

### Triangular Pyramid

Length = n
 Surface area 3.06645e+10 2.77618e+14 108641

## Cryptographic Hash Functions

md5 b00ee10d7769b49dfe29e575e5c09300 dbbf32d1c8637a2b7acd43bcb6d8c2cb077d8c98 c3c591e06e38ef335351af130cf3b9750d31d8bfb5acebd97316caf574dc2b98 c69f0af8c20ad662d4b27363c1db332b121299b8ea93e65e3478b203e83fe051e73377c908f2bb9d52938dd57969d351fa05112dd8ea838210b675f84398bf68 769c053f1335788a8d06f0f226297642dd5a3fdb
{"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}