5976
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 16380
- Proper Divisor Sum (Aliquot Sum)
- 10404
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1968
- Möbius Function
- 0
- Radical
- 498
- Omega Function (Ω)
- 6
- 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
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Generalized class numbers c_(n,1).at n=42A000233
- Coordination sequence T2 for Cordierite.at n=46A008252
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 19.at n=33A031517
- Let f(x) = (Pi - 2*arctan(1/(sqrt(x)*sqrt(x+2))))/(2*sqrt(x)*sqrt(x+2)), take (-1)^n*(n-th derivative from right at x=0) and multiply by A001147(n+1).at n=4A034405
- Schoenheim bound L_1(n,4,3).at n=49A036831
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2) = k; sequence gives values of k.at n=30A048191
- Numbers k such that 2k-1 divides 2^k-1.at n=11A081856
- Smallest number which requires n iterations to reach a prime when iterating x + sum of squares of digits of x.at n=32A094658
- Numbers k such that phi(k) + prime(k) is a triangular number.at n=25A115908
- Numbers k such that k and 7*k, taken together, are zeroless pandigital.at n=5A115931
- Numbers k such that the number of prime divisors of the k-th Catalan number (counted with multiplicity) divides k.at n=23A121612
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns of even length (0 <= k < n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=36A121748
- Number of deco polyominoes of height n, consisting only of columns of odd length. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=8A121749
- a(n) = 3*a(n-1) - a(n-2) - a(n-3) + 12.at n=8A121991
- Numbers k such that there is a bigger number m satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=21A124140
- Number of ways to place n+3 queens and 3 pawns on an n X n board so that no two queens attack each other.at n=10A129553
- Coefficients of Laguerre recursive polynomials with an (n+2)!/2 multiplication factor and alpha=a0 =0 from Hochstadt: P(x, n) = (2*n + a0 + 1 - x)*P(x, n - 1)/(n + 1) - n*P(x, n - 2)/(n + 1);.at n=25A136533
- Concatenation of first two digits and last two digits of n-th even perfect number.at n=21A138875
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 1100-0111-1100 pattern in any orientation.at n=10A146681
- Integers k such that (k^3)/3 is the average of a pair of twin primes.at n=35A152788