## 53393

53,393 (fifty-three thousand three hundred ninety-three) is an odd five-digits composite number following 53392 and preceding 53394. In scientific notation, it is written as 5.3393 × 104. The sum of its digits is 23. It has a total of 2 prime factors and 4 positive divisors. There are 52,788 positive integers (up to 53393) that are relatively prime to 53393.

## Basic properties

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

## Name

Short name 53 thousand 393 fifty-three thousand three hundred ninety-three

## Notation

Scientific notation 5.3393 × 104 53.393 × 103

## Prime Factorization of 53393

Prime Factorization 107 × 499

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 53393 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 53,393 is 107 × 499. Since it has a total of 2 prime factors, 53,393 is a composite number.

## Divisors of 53393

1, 107, 499, 53393

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) 54000 Sum of all the positive divisors of n s(n) 607 Sum of the proper positive divisors of n A(n) 13500 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 231.069 Returns the nth root of the product of n divisors H(n) 3.95504 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 53,393 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 53,393) is 54,000, the average is 13,500.

## Other Arithmetic Functions (n = 53393)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 52788 Total number of positive integers not greater than n that are coprime to n λ(n) 26394 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 5442 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 52,788 positive integers (less than 53,393) that are coprime with 53,393. And there are approximately 5,442 prime numbers less than or equal to 53,393.

## Divisibility of 53393

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

53,393 is not divisible by any number less than or equal to 9.

## Classification of 53393

• Arithmetic
• Semiprime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (53393)

Base System Value
2 Binary 1101000010010001
3 Ternary 2201020112
4 Quaternary 31002101
5 Quinary 3202033
6 Senary 1051105
8 Octal 150221
10 Decimal 53393
12 Duodecimal 26a95
20 Vigesimal 6d9d
36 Base36 1575

## Basic calculations (n = 53393)

### Multiplication

n×i
 n×2 106786 160179 213572 266965

### Division

ni
 n⁄2 26696.5 17797.7 13348.2 10678.6

### Exponentiation

ni
 n2 2850812449 152213429089457 8127131619373377601 433931938553202750250193

### Nth Root

i√n
 2√n 231.069 37.6555 15.201 8.82057

## 53393 as geometric shapes

### Circle

 Diameter 106786 335478 8.95609e+09

### Sphere

 Volume 6.3759e+14 3.58244e+10 335478

### Square

Length = n
 Perimeter 213572 2.85081e+09 75509.1

### Cube

Length = n
 Surface area 1.71049e+10 1.52213e+14 92479.4

### Equilateral Triangle

Length = n
 Perimeter 160179 1.23444e+09 46239.7

### Triangular Pyramid

Length = n
 Surface area 4.93775e+09 1.79385e+13 43595.2

## Cryptographic Hash Functions

md5 0e4db57136770ae75340c7c61df00315 90f18633ac59513f3ced6096b9c8358d789a1e86 7f482f473b5fe172600118f558a12fd1828c8fb51fdaa396a038c532fdfd4a90 93b21906ef060fa46b162c971c814bb01a08399ef67390d3f863868972d2a690c31e8f4b63dad617e891b323367fbfba012559deecf18e39b84f550a04e46e7d 267b5fee65cf91f80c235d40b165ca3f10a1237a
{"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}