4560
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 14880
- Proper Divisor Sum (Aliquot Sum)
- 10320
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1152
- Möbius Function
- 0
- Radical
- 570
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- yes
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- yes
- 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
- 108
- 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
- Hexagonal numbers: a(n) = n*(2*n-1).at n=48A000384
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals up to rotation.at n=35A003451
- Binomial coefficient C(8n,n-10).at n=2A004391
- Cubes written in base 9.at n=14A004639
- If n mod 2 = 0 then n*(n^2-4)/12 else n*(n^2-1)/12.at n=38A006584
- Coordination sequence T11 for Zeolite Code MFI.at n=43A008163
- Coordination sequence T7 for Zeolite Code NES.at n=43A008211
- Coordination sequence T4 for Zeolite Code -CHI.at n=43A009849
- a(n) = floor(n*(n-1)*(n-2)/13).at n=40A011895
- Number of labeled connected graphs with n nodes and 2 cutpoints.at n=2A013924
- Even triangular numbers.at n=47A014494
- a(n) = 2*n*(4*n - 1).at n=24A014635
- Binomial coefficients C(n,94).at n=2A017758
- Binomial coefficients C(96,n).at n=2A017812
- a(n) = 1*(n+3-1) + 2*(n+3-2) + .... + k*(n+3-k), where k=floor((n+1)/2).at n=35A023857
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A000201 (lower Wythoff sequence).at n=19A024593
- 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 = (natural numbers >= 2).at n=35A024853
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (natural numbers), t = (natural numbers >= 3).at n=34A024854
- a(n) = Sum_{k=1..n} k*floor( prime(k)/k ).at n=49A024927
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A000201 (lower Wythoff sequence).at n=18A025107