# 6696 (number)

6,696 (six thousand six hundred ninety-six) is an even four-digits composite number following 6695 and preceding 6697. In scientific notation, it is written as 6.696 × 103. The sum of its digits is 27. It has a total of 7 prime factors and 32 positive divisors. There are 2,160 positive integers (up to 6696) that are relatively prime to 6696.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 4
• Sum of Digits 27
• Digital Root 9

## Name

Short name 6 thousand 696 six thousand six hundred ninety-six

## Notation

Scientific notation 6.696 × 103 6.696 × 103

## Prime Factorization of 6696

Prime Factorization 23 × 33 × 31

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 7 Total number of prime factors rad(n) 186 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 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 6,696 is 23 × 33 × 31. Since it has a total of 7 prime factors, 6,696 is a composite number.

## Divisors of 6696

1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 31, 36, 54, 62, 72, 93, 108, 124, 186, 216, 248, 279, 372, 558, 744, 837, 1116, 1674, 2232, 3348, 6696

32 divisors

 Even divisors 24 8 4 4
Total Divisors Sum of Divisors Aliquot Sum τ(n) 32 Total number of the positive divisors of n σ(n) 19200 Sum of all the positive divisors of n s(n) 12504 Sum of the proper positive divisors of n A(n) 600 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 81.8291 Returns the nth root of the product of n divisors H(n) 11.16 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 6,696 can be divided by 32 positive divisors (out of which 24 are even, and 8 are odd). The sum of these divisors (counting 6,696) is 19,200, the average is 600.

## Other Arithmetic Functions (n = 6696)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 2160 Total number of positive integers not greater than n that are coprime to n λ(n) 180 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 867 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 2,160 positive integers (less than 6,696) that are coprime with 6,696. And there are approximately 867 prime numbers less than or equal to 6,696.

## Divisibility of 6696

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

The number 6,696 is divisible by 2, 3, 4, 6, 8 and 9.

## Classification of 6696

• Arithmetic
• Abundant

### Expressible via specific sums

• Polite
• Practical
• Non-hypotenuse

## Base conversion (6696)

Base System Value
2 Binary 1101000101000
3 Ternary 100012000
4 Quaternary 1220220
5 Quinary 203241
6 Senary 51000
8 Octal 15050
10 Decimal 6696
12 Duodecimal 3a60
20 Vigesimal geg
36 Base36 560

## Basic calculations (n = 6696)

### Multiplication

n×y
 n×2 13392 20088 26784 33480

### Division

n÷y
 n÷2 3348 2232 1674 1339.2

### Exponentiation

ny
 n2 44836416 300224641536 2010304199725056 13460996921358974976

### Nth Root

y√n
 2√n 81.8291 18.8483 9.04594 5.82322

## 6696 as geometric shapes

### Circle

 Diameter 13392 42072.2 1.40858e+08

### Sphere

 Volume 1.25758e+12 5.63431e+08 42072.2

### Square

Length = n
 Perimeter 26784 4.48364e+07 9469.57

### Cube

Length = n
 Surface area 2.69018e+08 3.00225e+11 11597.8

### Equilateral Triangle

Length = n
 Perimeter 20088 1.94147e+07 5798.91

### Triangular Pyramid

Length = n
 Surface area 7.7659e+07 3.53818e+10 5467.26

## Cryptographic Hash Functions

md5 d1ff1ec86b62cd5f3903ff19c3a326b2 e4578c7472cf38eeab516c05c8c99f656d4951bd a2e06365327c05110f5eeb6192068ff9d10ffbbaecdbbf63d2f96c90b20e8768 171cc554d036534bae8575f6149c07890cde31ee54dd8c54c809b8790f09f0cdabb08de879a910c00d31f969fb3737da0cccd8043c460e9d7db7bd9e07893626 32b81f511da8e3abaa037ca4e072ffb4ce8325c5
{"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}