# 36033 (number)

36,033 (thirty-six thousand thirty-three) is an odd five-digits composite number following 36032 and preceding 36034. In scientific notation, it is written as 3.6033 × 104. The sum of its digits is 15. It has a total of 2 prime factors and 4 positive divisors. There are 24,020 positive integers (up to 36033) that are relatively prime to 36033.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 15
• Digital Root 6

## Name

Short name 36 thousand 33 thirty-six thousand thirty-three

## Notation

Scientific notation 3.6033 × 104 36.033 × 103

## Prime Factorization of 36033

Prime Factorization 3 × 12011

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 36033 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 36,033 is 3 × 12011. Since it has a total of 2 prime factors, 36,033 is a composite number.

## Divisors of 36033

1, 3, 12011, 36033

4 divisors

 Even divisors 0 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 48048 Sum of all the positive divisors of n s(n) 12015 Sum of the proper positive divisors of n A(n) 12012 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 189.824 Returns the nth root of the product of n divisors H(n) 2.99975 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 36,033 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 36,033) is 48,048, the average is 12,012.

## Other Arithmetic Functions (n = 36033)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 24020 Total number of positive integers not greater than n that are coprime to n λ(n) 12010 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 3826 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 24,020 positive integers (less than 36,033) that are coprime with 36,033. And there are approximately 3,826 prime numbers less than or equal to 36,033.

## Divisibility of 36033

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

The number 36,033 is divisible by 3.

## Classification of 36033

• Arithmetic
• Semiprime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (36033)

Base System Value
2 Binary 1000110011000001
3 Ternary 1211102120
4 Quaternary 20303001
5 Quinary 2123113
6 Senary 434453
8 Octal 106301
10 Decimal 36033
12 Duodecimal 18a29
20 Vigesimal 4a1d
36 Base36 rsx

## Basic calculations (n = 36033)

### Multiplication

n×y
 n×2 72066 108099 144132 180165

### Division

n÷y
 n÷2 18016.5 12011 9008.25 7206.6

### Exponentiation

ny
 n2 1298377089 46784421647937 1685783065240113921 60743821189797024915393

### Nth Root

y√n
 2√n 189.824 33.0294 13.7776 8.15343

## 36033 as geometric shapes

### Circle

 Diameter 72066 226402 4.07897e+09

### Sphere

 Volume 1.9597e+14 1.63159e+10 226402

### Square

Length = n
 Perimeter 144132 1.29838e+09 50958.4

### Cube

Length = n
 Surface area 7.79026e+09 4.67844e+13 62411

### Equilateral Triangle

Length = n
 Perimeter 108099 5.62214e+08 31205.5

### Triangular Pyramid

Length = n
 Surface area 2.24886e+09 5.5136e+12 29420.8

## Cryptographic Hash Functions

md5 a290c7b96bb914e661a0c8379077231f 38386539660b94988491417c932dad544d8b008e ba0edc00bd4864518d5c1a963b72708718edaf47f7e3a6020ecf91f4925f9417 55b714db58339e9a54a4c639267e5a1ec9fb8a5cb07b0782713bc0077b322d088ffa8b892ef3812695ac169a8c8563279c6724a0d0d951647276723e0039e49d 5d23dcab1ac19aec0839acb5f4c922bb95e2ed37
{"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}