5596
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 9800
- Proper Divisor Sum (Aliquot Sum)
- 4204
- 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
- 2796
- Möbius Function
- 0
- Radical
- 2798
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 67
- 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
- Coordination sequence T5 for Zeolite Code VNI.at n=46A009911
- Coordination sequence for sigma-CrFe, Position Xf.at n=19A009958
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite ATT = AlPO4-12-TAMU [Al12P12O48].4R starting with a T1 atom.at n=5A018989
- Numbers k such that the continued fraction for sqrt(k) has period 92.at n=9A020431
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 42 ones.at n=23A031810
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives k values.at n=37A053721
- a(n) = Sum_{k=1..n} sigma(k)*2^(n-k) where sigma(k) = A000203(k) is the sum of divisors of k.at n=10A066767
- a(n) = Sum_{k=1..n} Sum_{d=1..k} (k mod d).at n=46A072481
- Sum of products of squares of parts in all partitions of n.at n=9A077335
- A000041(n)-A000010(n).at n=29A086739
- Sum of the entries in the character table of the alternating group A_n.at n=9A086808
- Number of partitions of 2n for which the square of the largest part equals the sum of the squares of the other parts.at n=31A098101
- Least k such that k * M(n) * M(n+1) + 1 is prime where M(n) = A000668(n).at n=17A098917
- Number of partitions of 2n in which odd parts and multiples of 3 and 5 occur with even multiplicities. There is no restriction on the other even parts.at n=22A102346
- Numbers k such that k^4 contains a pandigital substring.at n=9A115934
- Consider n x n chessboard. This sequence gives number of chess knight paths from left bottom corner of the board to the right top corner with minimal possible path length (shortest paths).at n=13A120399
- Numbers n such that n^3 is zeroless pandigital.at n=19A124628
- Number of partitions of n minus number of divisors of n.at n=29A144300
- A triangular sequence recursion: A(n,k)=A(n - 1, k - 1) + A(n - 1, k) + (5 (-2 + n) (-7 + 5 n))*A(n - 2, k - 1).at n=34A153879
- A triangular sequence recursion: A(n,k)=A(n - 1, k - 1) + A(n - 1, k) + (5 (-2 + n) (-7 + 5 n))*A(n - 2, k - 1).at n=29A153879