5008
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 9734
- Proper Divisor Sum (Aliquot Sum)
- 4726
- 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
- 2496
- Möbius Function
- 0
- Radical
- 626
- Omega Function (Ω)
- 5
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 134
- 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 T3 for Zeolite Code MTN.at n=42A008188
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite EAB = TMA-E (Aiello and Barrer)(1) (Me4N)2Na7[Al9Si27O7] starting with a T1 atom.at n=5A019011
- n written in fractional base 10/5.at n=48A024660
- Number of partitions in parts not of the form 23k, 23k+1 or 23k-1. Also number of partitions with no part of size 1 and differences between parts at distance 10 are greater than 1.at n=38A035989
- Triangle T(n,k) giving number of 4 X k polyominoes with n cells (n >= 4, 1<=k<=n-3).at n=49A059684
- a(1) = 1; a(n) = sum of terms in the continued fraction for the square of the continued fraction [a(1); a(2), a(3), a(4),..., a(n-1)].at n=38A061143
- 1 + Sum_{n>=1} a_n x^n = 1/Product_{n>=1} (1+x^n)^prime(n).at n=33A061151
- a(n) = Sum_{m=1..n} m*n^(m+(-1)^n).at n=4A068476
- Numbers k such that [A070080(k), A070081(k), A070082(k)] is an obtuse integer triangle with integer area.at n=27A070147
- Numbers n such that [A070080(n), A070081(n), A070082(n)] is an integer triangle with integer inradius.at n=36A070209
- Number of permutations of length n such that at least one absolute difference between consecutive elements has a distinct partner.at n=6A084894
- Monotonically increasing sequence of least positive integers, a(1)=1, such that the self-convolution produces all squares.at n=18A087150
- Number of configurations of the 3-dimensional 3 X 3 X 3 sliding cube puzzle that require a minimum of n moves to be reached, starting with the empty space at the center of one of the 6 faces of the combination cube.at n=7A090575
- Matrix square of triangle A091613.at n=67A091615
- Non-cubefree numbers k such that 2k+1 is also non-cubefree (A046099).at n=34A115170
- a(n) = 3 + floor((2 + Sum_{j=1..n-1} a(j))/4).at n=33A120162
- a(n) = (n! - 2^n)/8, n >= 4.at n=4A123367
- Call an n X n matrix robust if the top left i X i submatrix is invertible for all i = 1..n. Sequence gives number of n X n robust real {0,1}-matrices.at n=3A125587
- a(n) = 2*a(n-1)+6*a(n-2) for n>=3, a(0)=1, a(1)=2, a(2)=8.at n=7A133592
- Numbers of the form x^4 + 6*x^2*y^2 + y^4 (where x,y are positive integers).at n=21A135797