## 56459

56,459 (fifty-six thousand four hundred fifty-nine) is an odd five-digits composite number following 56458 and preceding 56460. In scientific notation, it is written as 5.6459 × 104. The sum of its digits is 29. It has a total of 3 prime factors and 8 positive divisors. There are 50,400 positive integers (up to 56459) that are relatively prime to 56459.

## Basic properties

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

## Name

Short name 56 thousand 459 fifty-six thousand four hundred fifty-nine

## Notation

Scientific notation 5.6459 × 104 56.459 × 103

## Prime Factorization of 56459

Prime Factorization 13 × 43 × 101

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 56459 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,459 is 13 × 43 × 101. Since it has a total of 3 prime factors, 56,459 is a composite number.

## Divisors of 56459

1, 13, 43, 101, 559, 1313, 4343, 56459

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) 62832 Sum of all the positive divisors of n s(n) 6373 Sum of the proper positive divisors of n A(n) 7854 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 237.611 Returns the nth root of the product of n divisors H(n) 7.18857 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 56,459 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 56,459) is 62,832, the average is 7,854.

## Other Arithmetic Functions (n = 56459)

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

## Divisibility of 56459

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

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

## Classification of 56459

• Arithmetic
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael
• Sphenic

## Base conversion (56459)

Base System Value
2 Binary 1101110010001011
3 Ternary 2212110002
4 Quaternary 31302023
5 Quinary 3301314
6 Senary 1113215
8 Octal 156213
10 Decimal 56459
12 Duodecimal 2880b
16 Hexadecimal dc8b
20 Vigesimal 712j
36 Base36 17kb

## Basic calculations (n = 56459)

### Multiplication

n×i
 n×2 112918 169377 225836 282295

### Division

ni
 n⁄2 28229.5 18819.7 14114.8 11291.8

### Exponentiation

ni
 n2 3187618681 179969763110579 10160912855460179761 573674978906426289126299

### Nth Root

i√n
 2√n 237.611 38.3629 15.4146 8.91963

## 56459 as geometric shapes

### Circle

Radius = n
 Diameter 112918 354742 1.00142e+10

### Sphere

Radius = n
 Volume 7.53856e+14 4.00568e+10 354742

### Square

Length = n
 Perimeter 225836 3.18762e+09 79845.1

### Cube

Length = n
 Surface area 1.91257e+10 1.7997e+14 97789.9

### Equilateral Triangle

Length = n
 Perimeter 169377 1.38028e+09 48894.9

### Triangular Pyramid

Length = n
 Surface area 5.52112e+09 2.12096e+13 46098.6

## Cryptographic Hash Functions

md5 b661d2e56f9c4a779f45f39c7f498ec2 fd59e98a860b8ff20012e2003b5763892ef2fba1 8a7567eea3ca5e03b4a47323d1fd3035b7bf8a672d0bfb304d778591da77b358 1268829fc2f678b17df4ceea0752017472884e50b0646f0b3b3f77292a04e3190ad5b6e5730a8799b95aab0439e1efd20946e570839fc36fe1ad068ce30edd2e cc5533ec1cf0e743c3a331e22059553ec7550789
{"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}