# 65713 (number)

65,713 (sixty-five thousand seven hundred thirteen) is an odd five-digits prime number following 65712 and preceding 65714. In scientific notation, it is written as 6.5713 × 104. The sum of its digits is 22. It has a total of 1 prime factor and 2 positive divisors. There are 65,712 positive integers (up to 65713) that are relatively prime to 65713.

## Basic properties

• Is Prime? Yes
• Number parity Odd
• Number length 5
• Sum of Digits 22
• Digital Root 4

## Name

Short name 65 thousand 713 sixty-five thousand seven hundred thirteen

## Notation

Scientific notation 6.5713 × 104 65.713 × 103

## Prime Factorization of 65713

Prime Factorization 65713

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

The prime factorization of 65,713 is 65713. Since it has a total of 1 prime factor, 65,713 is a prime number.

## Divisors of 65713

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) 65714 Sum of all the positive divisors of n s(n) 1 Sum of the proper positive divisors of n A(n) 32857 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 256.345 Returns the nth root of the product of n divisors H(n) 1.99997 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 65,713 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 65,713) is 65,714, the average is 32,857.

## Other Arithmetic Functions (n = 65713)

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

## Divisibility of 65713

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

65,713 is not divisible by any number less than or equal to 9.

• Arithmetic
• Prime
• Deficient

• Polite

• Prime Power
• Square Free

## Base conversion (65713)

Base System Value
2 Binary 10000000010110001
3 Ternary 10100010211
4 Quaternary 100002301
5 Quinary 4100323
6 Senary 1224121
8 Octal 200261
10 Decimal 65713
12 Duodecimal 32041
20 Vigesimal 845d
36 Base36 1epd

## Basic calculations (n = 65713)

### Multiplication

n×y
 n×2 131426 197139 262852 328565

### Division

n÷y
 n÷2 32856.5 21904.3 16428.2 13142.6

### Exponentiation

ny
 n2 4318198369 283761769422097 18646837154034260161 1225339609903053337959793

### Nth Root

y√n
 2√n 256.345 40.3537 16.0108 9.19455

## 65713 as geometric shapes

### Circle

 Diameter 131426 412887 1.3566e+10

### Sphere

 Volume 1.18862e+15 5.42641e+10 412887

### Square

Length = n
 Perimeter 262852 4.3182e+09 92932.2

### Cube

Length = n
 Surface area 2.59092e+10 2.83762e+14 113818

### Equilateral Triangle

Length = n
 Perimeter 197139 1.86983e+09 56909.1

### Triangular Pyramid

Length = n
 Surface area 7.47934e+09 3.34416e+13 53654.4
{"ft_lang_label":"__label__en","ft_lang_prob":0.6206535,"math_prob":0.99098486,"size":4563,"snap":"2021-43-2021-49","text_gpt3_token_len":1604,"char_repetition_ratio":0.121517874,"word_repetition_ratio":0.029673591,"special_character_ratio":0.4547447,"punctuation_ratio":0.075738125,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9989157,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-11-27T23:10:51Z\",\"WARC-Record-ID\":\"<urn:uuid:f97fad1e-5b7a-48cb-9c85-efee35ea682f>\",\"Content-Length\":\"39502\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8824e1be-c916-4ee1-a9d2-e005863be564>\",\"WARC-Concurrent-To\":\"<urn:uuid:074bcacd-32cd-4182-abe0-4435d37dc847>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/65713\",\"WARC-Payload-Digest\":\"sha1:BFPNTPOY54HPDRDLK6KDMDICA7X52FL4\",\"WARC-Block-Digest\":\"sha1:CFPX6ZMZYEAR7TF6GPQCCDFWBSOUGQ5G\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964358323.91_warc_CC-MAIN-20211127223710-20211128013710-00019.warc.gz\"}"}