## 56801

56,801 (fifty-six thousand eight hundred one) is an odd five-digits composite number following 56800 and preceding 56802. In scientific notation, it is written as 5.6801 × 104. The sum of its digits is 20. It has a total of 2 prime factors and 4 positive divisors. There are 56,004 positive integers (up to 56801) that are relatively prime to 56801.

## Basic properties

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

## Name

Short name 56 thousand 801 fifty-six thousand eight hundred one

## Notation

Scientific notation 5.6801 × 104 56.801 × 103

## Prime Factorization of 56801

Prime Factorization 79 × 719

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

## Divisors of 56801

1, 79, 719, 56801

4 divisors

 Even divisors 0 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 57600 Sum of all the positive divisors of n s(n) 799 Sum of the proper positive divisors of n A(n) 14400 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 238.33 Returns the nth root of the product of n divisors H(n) 3.94451 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 56,801 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 56,801) is 57,600, the average is 14,400.

## Other Arithmetic Functions (n = 56801)

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

## Divisibility of 56801

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

56,801 is not divisible by any number less than or equal to 9.

## Classification of 56801

• Arithmetic
• Semiprime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (56801)

Base System Value
2 Binary 1101110111100001
3 Ternary 2212220202
4 Quaternary 31313201
5 Quinary 3304201
6 Senary 1114545
8 Octal 156741
10 Decimal 56801
12 Duodecimal 28a55
20 Vigesimal 7201
36 Base36 17tt

## Basic calculations (n = 56801)

### Multiplication

n×i
 n×2 113602 170403 227204 284005

### Division

ni
 n⁄2 28400.5 18933.7 14200.2 11360.2

### Exponentiation

ni
 n2 3226353601 183260110890401 10409357558685667201 591261918690904582684001

### Nth Root

i√n
 2√n 238.33 38.4402 15.4379 8.93041

## 56801 as geometric shapes

### Circle

 Diameter 113602 356891 1.01359e+10

### Sphere

 Volume 7.67638e+14 4.05436e+10 356891

### Square

Length = n
 Perimeter 227204 3.22635e+09 80328.7

### Cube

Length = n
 Surface area 1.93581e+10 1.8326e+14 98382.2

### Equilateral Triangle

Length = n
 Perimeter 170403 1.39705e+09 49191.1

### Triangular Pyramid

Length = n
 Surface area 5.58821e+09 2.15974e+13 46377.8

## Cryptographic Hash Functions

md5 bb3fa9b98a782af29f14dc2876ca6f65 953ae1915ad7b3993b0a97434aba590d448a3766 3426b1b1c10a3c93c0947accc41e6d48c4d8d22ccd5d12541c4971de4decdf8f d86a36cbbc6baa76fc675bfd2c27ac4dd39e9c1125565a67d6ba6c6e092398ec743923e6ee4e821d54a4eda48ecab413fcc57e88498c130b8f72ff1bb30dc6a7 54178206cd65d3f7124209d7d99cc48384ececdd
{"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, "url": "https://metanumbers.com/56801", "fetch_time": 1596995233000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2020-34/segments/1596439738562.5/warc/CC-MAIN-20200809162458-20200809192458-00377.warc.gz", "warc_record_offset": 409663464, "warc_record_length": 7479, "token_count": 1470, "char_count": 4201, "score": 3.765625, "int_score": 4, "crawl": "CC-MAIN-2020-34", "snapshot_type": "latest", "language": "en", "language_score": 0.8230136036872864, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00029-of-00064.parquet"}