# 10893 (number)

10,893 (ten thousand eight hundred ninety-three) is an odd five-digits composite number following 10892 and preceding 10894. In scientific notation, it is written as 1.0893 × 104. The sum of its digits is 21. It has a total of 2 prime factors and 4 positive divisors. There are 7,260 positive integers (up to 10893) that are relatively prime to 10893.

## Basic properties

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

## Name

Short name 10 thousand 893 ten thousand eight hundred ninety-three

## Notation

Scientific notation 1.0893 × 104 10.893 × 103

## Prime Factorization of 10893

Prime Factorization 3 × 3631

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

## Divisors of 10893

1, 3, 3631, 10893

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) 14528 Sum of all the positive divisors of n s(n) 3635 Sum of the proper positive divisors of n A(n) 3632 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 104.37 Returns the nth root of the product of n divisors H(n) 2.99917 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 10,893 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 10,893) is 14,528, the average is 3,632.

## Other Arithmetic Functions (n = 10893)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 7260 Total number of positive integers not greater than n that are coprime to n λ(n) 3630 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 1326 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 7,260 positive integers (less than 10,893) that are coprime with 10,893. And there are approximately 1,326 prime numbers less than or equal to 10,893.

## Divisibility of 10893

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

The number 10,893 is divisible by 3.

## Classification of 10893

• Arithmetic
• Semiprime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (10893)

Base System Value
2 Binary 10101010001101
3 Ternary 112221110
4 Quaternary 2222031
5 Quinary 322033
6 Senary 122233
8 Octal 25215
10 Decimal 10893
12 Duodecimal 6379
20 Vigesimal 174d
36 Base36 8el

## Basic calculations (n = 10893)

### Multiplication

n×y
 n×2 21786 32679 43572 54465

### Division

n÷y
 n÷2 5446.5 3631 2723.25 2178.6

### Exponentiation

ny
 n2 118657449 1292535591957 14079590203187601 153368976083322537693

### Nth Root

y√n
 2√n 104.37 22.1675 10.2161 6.41844

## 10893 as geometric shapes

### Circle

 Diameter 21786 68442.7 3.72773e+08

### Sphere

 Volume 5.41416e+12 1.49109e+09 68442.7

### Square

Length = n
 Perimeter 43572 1.18657e+08 15405

### Cube

Length = n
 Surface area 7.11945e+08 1.29254e+12 18867.2

### Equilateral Triangle

Length = n
 Perimeter 32679 5.13802e+07 9433.61

### Triangular Pyramid

Length = n
 Surface area 2.05521e+08 1.52327e+11 8894.1

## Cryptographic Hash Functions

md5 2990d25f0152b653b68bc2f7994a05f1 f5e50dacb73c30d7bb163a6ec282cbbac1d30c9c d98d55d3113e603739b33d0a56da5b937fbb63d4dd149f1c4ba448355bb47fb0 5384252cf7984689a56e0caa35213c3d9dd9584fa488c5fd9c8f51262264b00395f04b9ec69c42c42856107e50f63d611bdfd3adb39df3e54b75d15c2d9b75a6 0347561e6058f8a3d7c5376576d46a76c1b33839
{"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}