1304
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2460
- Proper Divisor Sum (Aliquot Sum)
- 1156
- 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
- 648
- Möbius Function
- 0
- Radical
- 326
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 26
- 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
- Number of 4-level labeled rooted trees with n leaves.at n=5A000307
- Numbers that are the sum of 8 positive 5th powers.at n=47A003353
- Number of n-step mappings with 5 inputs.at n=3A005946
- a(n) = Sum_{k=1..n-1} (k OR n-k).at n=39A006583
- Discriminants of totally real cubic fields.at n=34A006832
- Numbers k such that phi(x) = k has exactly 3 solutions.at n=48A007367
- Array (a frieze pattern) defined by a(n,k) = (a(n-1,k)*a(n-1,k+1) - 1) / a(n-2,k+1), read by antidiagonals.at n=35A007754
- Coordination sequence T2 for Zeolite Code ATS.at n=26A008039
- Molien series for Weyl group E_7.at n=36A008583
- Expansion of (1+x)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=41A008762
- Coordination sequence T2 for Zeolite Code -WEN.at n=26A009863
- Coordination sequence T2 for Zeolite Code RTH.at n=25A009894
- exp(cos(x)*arctan(x))=1+x+1/2!*x^2-4/3!*x^3-19/4!*x^4+445/6!*x^6...at n=7A012496
- sinh(cos(x)*arctan(x))=x-4/3!*x^3+1304/7!*x^7-109120/9!*x^9...at n=3A012502
- Positive numbers k such that k and 3*k are anagrams in base 9 (written in base 9).at n=9A023080
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = (F(2), F(3), F(4), ...), F(n) = Fibonacci(n).at n=11A023864
- a(n) = 11^n - n^3.at n=3A024130
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (Fibonacci numbers).at n=11A024857
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (F(2), F(3), F(4), ... ).at n=10A024861
- Numbers that are the sum of 4 distinct nonzero squares in exactly 7 ways.at n=41A025382