5384
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10110
- 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
- 2688
- Möbius Function
- 0
- Radical
- 1346
- Omega Function (Ω)
- 4
- 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
- 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
- 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 17.at n=38A031515
- Number of binary [ n,3 ] codes.at n=18A034357
- Number of partitions of n with equal number of parts congruent to each of 2 and 3 (mod 4).at n=40A035545
- Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) <= cn(1,5) and cn(0,5) + cn(2,5) + cn(3,5) <= cn(4,5).at n=41A039908
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049723.at n=29A049725
- Triangle of coefficients in expansion of enumerators for series-reduced rooted trees by lines at the root.at n=64A058735
- Number of basis partitions of n+64 with Durfee square size 8.at n=20A069251
- Numbers k such that sigma(sigma(k) - k) = phi(sigma(k) + k).at n=7A074886
- Interprimes which are of the form s*prime, s=8.at n=11A075283
- a(n) = floor((n+2)^(n+2)/n^n).at n=26A078111
- a(0) = 0; a(1)=1; for n>1, a(n) = least positive integer m not among a(1),...,a(n-1) such that |m-a(n-1)| > |a(n-1)-a(n-2)|.at n=35A078783
- Successively larger gaps in Ulam numbers start at this Ulam number.at n=16A080287
- Numbers in increasing order such that successive sums are squares and successive differences are squarefree.at n=39A090956
- Indices of primes in the sequence defined by A(0) = 23, A(n) = 10*A(n-1) + 63 for n > 0.at n=10A101973
- Triangle read by rows: T(n,m) = number of unlabeled cographs on n nodes with m connected components.at n=68A106240
- First differences of A109033.at n=8A109034
- Number of partitions of n which represent first player winning Chomp positions.at n=30A112471
- Number at middle of segment n of A078783.at n=11A117071
- "Self-Lucas"; a(n) is the sum of the last 5 terms. Sequence starts with 12,21,3,1,19 which are l,u,c,a,s if you consider a=1, b=2, c=3, ..., z=26.at n=12A129939
- Triangle read by rows: A(n,k)=A(n - 1, k - 1) + A(n - 1, k) + (n + 1)*(n + 2)*A(n - 2, k - 1).at n=22A153658