# 97691 (number)

97,691 (ninety-seven thousand six hundred ninety-one) is an odd five-digits composite number following 97690 and preceding 97692. In scientific notation, it is written as 9.7691 × 104. The sum of its digits is 32. It has a total of 3 prime factors and 8 positive divisors. There are 86,920 positive integers (up to 97691) that are relatively prime to 97691.

## Basic properties

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

## Name

Short name 97 thousand 691 ninety-seven thousand six hundred ninety-one

## Notation

Scientific notation 9.7691 × 104 97.691 × 103

## Prime Factorization of 97691

Prime Factorization 11 × 83 × 107

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 97691 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 97,691 is 11 × 83 × 107. Since it has a total of 3 prime factors, 97,691 is a composite number.

## Divisors of 97691

1, 11, 83, 107, 913, 1177, 8881, 97691

8 divisors

 Even divisors 0 8 4 4
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 108864 Sum of all the positive divisors of n s(n) 11173 Sum of the proper positive divisors of n A(n) 13608 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 312.556 Returns the nth root of the product of n divisors H(n) 7.17894 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 97,691 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 97,691) is 108,864, the average is 13,608.

## Other Arithmetic Functions (n = 97691)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 86920 Total number of positive integers not greater than n that are coprime to n λ(n) 21730 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 9381 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 86,920 positive integers (less than 97,691) that are coprime with 97,691. And there are approximately 9,381 prime numbers less than or equal to 97,691.

## Divisibility of 97691

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

97,691 is not divisible by any number less than or equal to 9.

## Classification of 97691

• Arithmetic
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

### Other numbers

• LucasCarmichael
• Sphenic

## Base conversion (97691)

Base System Value
2 Binary 10111110110011011
3 Ternary 11222000012
4 Quaternary 113312123
5 Quinary 11111231
6 Senary 2032135
8 Octal 276633
10 Decimal 97691
12 Duodecimal 4864b
20 Vigesimal c44b
36 Base36 23dn

## Basic calculations (n = 97691)

### Multiplication

n×y
 n×2 195382 293073 390764 488455

### Division

n÷y
 n÷2 48845.5 32563.7 24422.8 19538.2

### Exponentiation

ny
 n2 9543531481 932317133910371 91078993128838053361 8897597917749318270889451

### Nth Root

y√n
 2√n 312.556 46.0559 17.6792 9.95339

## 97691 as geometric shapes

### Circle

 Diameter 195382 613811 2.99819e+10

### Sphere

 Volume 3.90528e+15 1.19928e+11 613811

### Square

Length = n
 Perimeter 390764 9.54353e+09 138156

### Cube

Length = n
 Surface area 5.72612e+10 9.32317e+14 169206

### Equilateral Triangle

Length = n
 Perimeter 293073 4.13247e+09 84602.9

### Triangular Pyramid

Length = n
 Surface area 1.65299e+10 1.09875e+14 79764.4

## Cryptographic Hash Functions

md5 7dc7da245e0ba77aa6d4cdcd6d536f9a 6c10d4496562054b431c788e7c6a4543d9ab49b8 1d63dcdfa838e996aa4656925135dce9902cc692f3b1a53cec46897ef924e1b7 b10664aff5648b475fecfced212e7ea6b16b03dcb300000b2dfcfbf460ab8f3d557b88cdc200919e09350264925e63e21f179f9115cc34ea8d1ee6655b6b8944 7738d6a6345b37b42e0b30898b0e5fa88e79dff2
{"ft_lang_label":"__label__en","ft_lang_prob":0.6225865,"math_prob":0.97098285,"size":4627,"snap":"2021-43-2021-49","text_gpt3_token_len":1639,"char_repetition_ratio":0.117888816,"word_repetition_ratio":0.02919708,"special_character_ratio":0.45061594,"punctuation_ratio":0.0747782,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9954425,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-02T13:30:59Z\",\"WARC-Record-ID\":\"<urn:uuid:5f0ca4e5-8480-4146-87dd-710a543fb0ec>\",\"Content-Length\":\"40137\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c863f131-ba68-4a26-ab0f-80d7698a52b0>\",\"WARC-Concurrent-To\":\"<urn:uuid:6a09efe8-e3c3-44ce-9671-fa3b608222e7>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/97691\",\"WARC-Payload-Digest\":\"sha1:VTMDC5NSJ7KVOK5NIFGCJ2SQEJBSC36X\",\"WARC-Block-Digest\":\"sha1:TZ4I5EMNC3NRNSRZ3SMMEOPKV3KFRDQG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964362219.5_warc_CC-MAIN-20211202114856-20211202144856-00009.warc.gz\"}"}