5957
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7296
- Proper Divisor Sum (Aliquot Sum)
- 1339
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4752
- Möbius Function
- -1
- Radical
- 5957
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 49
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers having period-2 6-digitized sequences.at n=16A031357
- Number of partitions of n into parts not of form 4k+2, 20k, 20k+9 or 20k-9. Also number of partitions in which no odd part is repeated, with at most 4 parts of size less than or equal to 2 and where differences between parts at distance 4 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=44A036028
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=46A036810
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 2.at n=45A051967
- 1 - (5/6)*n + (5/2)*n^2 + (10/3)*n^3 + n^4.at n=8A057675
- a(n) = sum of n-th row of the triangle formed by replacing each m in Pascal's triangle with the m-th prime.at n=10A074663
- Numbers which are the sum of two positive cubes and divisible by 23.at n=6A101806
- Numbers which are the sum of two positive cubes and divisible by 37.at n=7A102618
- Expansion of (7 +4*x -5*x^2 -7*x^3) / ((1-x)*(1-x^2-x^3)).at n=24A103485
- Triangle, read by rows, equal to the matrix square of A113370. Also given by the product: P^2 = Q*(R^-2)*Q^3, using triangular matrices P=A113370, Q=A113381 and R=A113389.at n=17A113374
- Column 2 of triangle A113374, also equals column 0 of A113381^7.at n=3A113377
- Triangle, read by rows, given by the product R^3*P^-1 using triangular matrices P=A113370, R=A113389.at n=11A114152
- 3-almost primes that are the sum of 2 positive cubes. Sums of 2 positive cubes, with the sums having exactly 3 prime divisors counted with multiplicity.at n=21A122732
- Numbers k such that 2^(k+1) + 3^k is prime.at n=41A123924
- a(n) = n*(4*n^2+5*n-3)/2.at n=13A126335
- Arithmetic mean of two consecutive prime interprimes of second order: interprimes of third order.at n=2A126556
- Numbers k such that 2^k == 18 (mod k).at n=8A128126
- G.f.s of the z^p coefficients of the polynomials in the GF2 denominators of A156925.at n=12A157703
- G.f.s of the z^p coefficients of the polynomials in the GF2 denominators of A156925.at n=11A157703
- Number of 0..n arrays x(0..3) of 4 elements with each no smaller than the sum of its previous elements modulo (n+1).at n=12A200253