5481
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 9600
- Proper Divisor Sum (Aliquot Sum)
- 4119
- 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
- 3024
- Möbius Function
- 0
- Radical
- 609
- Omega Function (Ω)
- 5
- 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
- 41
- 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
- no
- Odd
- yes
Appears in sequences
- Number of dissections of a polygon: binomial(6n,n)/(5n+1).at n=5A002295
- a(n) = (5*n^2 + 1)*n^2 / 6.at n=9A008354
- Molien series for cyclic group of order 5.at n=26A008646
- a(n) = floor(C(n,4)/5).at n=30A011795
- a(n) = floor(n*(n-1)*(n-2)/4).at n=29A011886
- Expansion of e.g.f.: exp(sec(x)-exp(x))=1-x+1/2!*x^2-2/3!*x^3+9/4!*x^4-32/5!*x^5...at n=8A013501
- Numbers k that divide s(k), where s(1)=1, s(j)=7*s(j-1)+j.at n=33A014854
- Odd numbers k that divide 25^k - 1.at n=44A014962
- Numbers k such that k | 5^k + 1.at n=32A015951
- a(n) = n*(13*n + 1)/2.at n=29A022271
- a(n) = n*(15*n + 1)/2.at n=27A022273
- An "extremely strange sequence": a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p dividing [ A*a(n)+B ] and p=2, A=4.001, B=1.2.at n=19A028948
- Shifts left under transform T where Ta is phi DCONV a.at n=44A038045
- Numbers k that divide 10^k + 2^k.at n=46A045583
- a(1) = 7; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=43A046257
- a(n)=T(n,n+3), array T as in A049723.at n=40A049731
- a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.at n=26A051170
- Triangular array T(n,k) giving the number of labeled even graphs with n nodes and k edges for n >= 0 and 0 <= k <= n*(n-1-[0 == n mod 2])/2 (with no trailing zeros).at n=47A054669
- Triangular array T(n,k) giving the number of labeled even graphs with n nodes and k edges for n >= 0 and 0 <= k <= n*(n-1-[0 == n mod 2])/2 (with no trailing zeros).at n=46A054669
- Numbers k such that k | sigma_9(k) - phi(k)^9.at n=18A055703