# 1997 (number)

1,997 (one thousand nine hundred ninety-seven) is an odd four-digits prime number following 1996 and preceding 1998. In scientific notation, it is written as 1.997 × 103. The sum of its digits is 26. It has a total of 1 prime factor and 2 positive divisors. There are 1,996 positive integers (up to 1997) that are relatively prime to 1997.

## Basic properties

• Is Prime? Yes
• Number parity Odd
• Number length 4
• Sum of Digits 26
• Digital Root 8

## Name

Short name 1 thousand 997 one thousand nine hundred ninety-seven

## Notation

Scientific notation 1.997 × 103 1.997 × 103

## Prime Factorization of 1997

Prime Factorization 1997

Prime number
Distinct Factors Total Factors Radical ω(n) 1 Total number of distinct prime factors Ω(n) 1 Total number of prime factors rad(n) 1997 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) 7.5994 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 1,997 is 1997. Since it has a total of 1 prime factor, 1,997 is a prime number.

## Divisors of 1997

2 divisors

 Even divisors 0 2 2 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 2 Total number of the positive divisors of n σ(n) 1998 Sum of all the positive divisors of n s(n) 1 Sum of the proper positive divisors of n A(n) 999 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 44.6878 Returns the nth root of the product of n divisors H(n) 1.999 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 1,997 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 1,997) is 1,998, the average is 999.

## Other Arithmetic Functions (n = 1997)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 1996 Total number of positive integers not greater than n that are coprime to n λ(n) 1996 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 306 Total number of primes less than or equal to n r2(n) 8 The number of ways n can be represented as the sum of 2 squares

There are 1,996 positive integers (less than 1,997) that are coprime with 1,997. And there are approximately 306 prime numbers less than or equal to 1,997.

## Divisibility of 1997

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

1,997 is not divisible by any number less than or equal to 9.

• Arithmetic
• Prime
• Deficient

• Polite

• Prime Power
• Square Free

## Base conversion (1997)

Base System Value
2 Binary 11111001101
3 Ternary 2201222
4 Quaternary 133031
5 Quinary 30442
6 Senary 13125
8 Octal 3715
10 Decimal 1997
12 Duodecimal 11a5
20 Vigesimal 4jh
36 Base36 1jh

## Basic calculations (n = 1997)

### Multiplication

n×y
 n×2 3994 5991 7988 9985

### Division

n÷y
 n÷2 998.5 665.666 499.25 399.4

### Exponentiation

ny
 n2 3988009 7964053973 15904215784081 31760718920809757

### Nth Root

y√n
 2√n 44.6878 12.5929 6.68489 4.57168

## 1997 as geometric shapes

### Circle

 Diameter 3994 12547.5 1.25287e+07

### Sphere

 Volume 3.33598e+10 5.01148e+07 12547.5

### Square

Length = n
 Perimeter 7988 3.98801e+06 2824.18

### Cube

Length = n
 Surface area 2.39281e+07 7.96405e+09 3458.91

### Equilateral Triangle

Length = n
 Perimeter 5991 1.72686e+06 1729.45

### Triangular Pyramid

Length = n
 Surface area 6.90743e+06 9.38573e+08 1630.54

## Cryptographic Hash Functions

md5 06964dce9addb1c5cb5d6e3d9838f733 2cfe534aa66900e81f6f20b02826b6132d2df8de 0985b889a1fe4f4e1fb925061ac6fb2247f10875f5fcbe63eec2ab55ed68970e 106d8c285b8d4ce4f095ef7cb89c0a4b1c5c2797187c54c3407db19fc505a59f89250d5546c62f9de9e82cf69f0c524e57325f424a5c2a975c4e75c1dc175171 273334ffbbb9ebf34ce1d358c967c597b2535ab8
{"ft_lang_label":"__label__en","ft_lang_prob":0.63504106,"math_prob":0.97594863,"size":4494,"snap":"2023-14-2023-23","text_gpt3_token_len":1791,"char_repetition_ratio":0.1247216,"word_repetition_ratio":0.027696794,"special_character_ratio":0.43791723,"punctuation_ratio":0.07341772,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9959613,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-25T08:24:27Z\",\"WARC-Record-ID\":\"<urn:uuid:35683869-5018-496a-af76-09f71133e9cd>\",\"Content-Length\":\"39999\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:791c4224-a4da-4705-a9d9-23e816bc4346>\",\"WARC-Concurrent-To\":\"<urn:uuid:79d66fa6-064e-4f46-b02b-def9ee72fe1d>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/1997\",\"WARC-Payload-Digest\":\"sha1:JWBPMOTA367H54WJYGNXYVKVDPDDCUBZ\",\"WARC-Block-Digest\":\"sha1:XDYP5XL5N7QCHC3BMD54N3DENV57HE54\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296945317.85_warc_CC-MAIN-20230325064253-20230325094253-00685.warc.gz\"}"}