# 10749 (number)

10,749 (ten thousand seven hundred forty-nine) is an odd five-digits composite number following 10748 and preceding 10750. In scientific notation, it is written as 1.0749 × 104. The sum of its digits is 21. It has a total of 2 prime factors and 4 positive divisors. There are 7,164 positive integers (up to 10749) that are relatively prime to 10749.

## Basic properties

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

## Name

Short name 10 thousand 749 ten thousand seven hundred forty-nine

## Notation

Scientific notation 1.0749 × 104 10.749 × 103

## Prime Factorization of 10749

Prime Factorization 3 × 3583

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

## Divisors of 10749

1, 3, 3583, 10749

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) 14336 Sum of all the positive divisors of n s(n) 3587 Sum of the proper positive divisors of n A(n) 3584 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 103.677 Returns the nth root of the product of n divisors H(n) 2.99916 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

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

## Other Arithmetic Functions (n = 10749)

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

## Divisibility of 10749

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

The number 10,749 is divisible by 3.

## Classification of 10749

• Arithmetic
• Semiprime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (10749)

Base System Value
2 Binary 10100111111101
3 Ternary 112202010
4 Quaternary 2213331
5 Quinary 320444
6 Senary 121433
8 Octal 24775
10 Decimal 10749
12 Duodecimal 6279
20 Vigesimal 16h9
36 Base36 8al

## Basic calculations (n = 10749)

### Multiplication

n×y
 n×2 21498 32247 42996 53745

### Division

n÷y
 n÷2 5374.5 3583 2687.25 2149.8

### Exponentiation

ny
 n2 115541001 1241950219749 13349722912082001 143496171581969428749

### Nth Root

y√n
 2√n 103.677 22.0693 10.1822 6.40138

## 10749 as geometric shapes

### Circle

 Diameter 21498 67538 3.62983e+08

### Sphere

 Volume 5.20227e+12 1.45193e+09 67538

### Square

Length = n
 Perimeter 42996 1.15541e+08 15201.4

### Cube

Length = n
 Surface area 6.93246e+08 1.24195e+12 18617.8

### Equilateral Triangle

Length = n
 Perimeter 32247 5.00307e+07 9308.91

### Triangular Pyramid

Length = n
 Surface area 2.00123e+08 1.46365e+11 8776.52

## Cryptographic Hash Functions

md5 69bfa2aa2b7b139ff581a806abf0a886 f5c53019ae359a0bafd217c0be76c6f4fcd40f7c d2cc09b64d0eba2f738d37100485b948b86966bbb783ce92e1c45b8fcf858b40 10a78d4d4074bf3a70a13150b6c78933337d4c50595d866e8bde90cb5b33fa5b339f4c3b59a7ae1b762927df60ddac455da77324ff1e826bb09d12b8d36ac31c d3fac507c158278d57f7b4b0c91f245fef455800
{"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}