## 56968

56,968 (fifty-six thousand nine hundred sixty-eight) is an even five-digits composite number following 56967 and preceding 56969. In scientific notation, it is written as 5.6968 × 104. The sum of its digits is 34. It has a total of 4 prime factors and 8 positive divisors. There are 28,480 positive integers (up to 56968) that are relatively prime to 56968.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 5
• Sum of Digits 34
• Digital Root 7

## Name

Short name 56 thousand 968 fifty-six thousand nine hundred sixty-eight

## Notation

Scientific notation 5.6968 × 104 56.968 × 103

## Prime Factorization of 56968

Prime Factorization 23 × 7121

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 14242 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 56,968 is 23 × 7121. Since it has a total of 4 prime factors, 56,968 is a composite number.

## Divisors of 56968

1, 2, 4, 8, 7121, 14242, 28484, 56968

8 divisors

 Even divisors 6 2 2 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 106830 Sum of all the positive divisors of n s(n) 49862 Sum of the proper positive divisors of n A(n) 13353.8 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 238.68 Returns the nth root of the product of n divisors H(n) 4.26607 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 56,968 can be divided by 8 positive divisors (out of which 6 are even, and 2 are odd). The sum of these divisors (counting 56,968) is 106,830, the average is 13,353,.75.

## Other Arithmetic Functions (n = 56968)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 28480 Total number of positive integers not greater than n that are coprime to n λ(n) 7120 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 5768 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 28,480 positive integers (less than 56,968) that are coprime with 56,968. And there are approximately 5,768 prime numbers less than or equal to 56,968.

## Divisibility of 56968

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

The number 56,968 is divisible by 2, 4 and 8.

• Refactorable
• Deficient

• Polite

## Base conversion (56968)

Base System Value
2 Binary 1101111010001000
3 Ternary 2220010221
4 Quaternary 31322020
5 Quinary 3310333
6 Senary 1115424
8 Octal 157210
10 Decimal 56968
12 Duodecimal 28b74
20 Vigesimal 7288
36 Base36 17yg

## Basic calculations (n = 56968)

### Multiplication

n×i
 n×2 113936 170904 227872 284840

### Division

ni
 n⁄2 28484 18989.3 14242 11393.6

### Exponentiation

ni
 n2 3245353024 184881271071232 10532316250385944576 600004992151986490605568

### Nth Root

i√n
 2√n 238.68 38.4778 15.4493 8.93565

## 56968 as geometric shapes

### Circle

 Diameter 113936 357941 1.01956e+10

### Sphere

 Volume 7.74429e+14 4.07823e+10 357941

### Square

Length = n
 Perimeter 227872 3.24535e+09 80564.9

### Cube

Length = n
 Surface area 1.94721e+10 1.84881e+14 98671.5

### Equilateral Triangle

Length = n
 Perimeter 170904 1.40528e+09 49335.7

### Triangular Pyramid

Length = n
 Surface area 5.62112e+09 2.17885e+13 46514.2
{"ft_lang_label":"__label__en","ft_lang_prob":0.6393128,"math_prob":0.9895887,"size":4496,"snap":"2020-34-2020-40","text_gpt3_token_len":1575,"char_repetition_ratio":0.11932324,"word_repetition_ratio":0.02560241,"special_character_ratio":0.45996442,"punctuation_ratio":0.08020698,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9984769,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-08-09T11:57:06Z\",\"WARC-Record-ID\":\"<urn:uuid:a0d751da-a4e4-4b5a-9146-a758e9fd3311>\",\"Content-Length\":\"47521\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6ccb3981-21d7-45d4-be40-cd4a4bbd8ccf>\",\"WARC-Concurrent-To\":\"<urn:uuid:33a2fc49-8f15-40a5-9088-e50b39a110aa>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/56968\",\"WARC-Payload-Digest\":\"sha1:356GIY3FFVKRX3NSILUKCFBL2Y2JDMMS\",\"WARC-Block-Digest\":\"sha1:QORTLW6GBNEZFM5567DXEN7NW5WLEBTG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-34/CC-MAIN-2020-34_segments_1596439738552.17_warc_CC-MAIN-20200809102845-20200809132845-00331.warc.gz\"}"}