4960
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 7136
- 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
- 1920
- Möbius Function
- 0
- Radical
- 310
- Omega Function (Ω)
- 7
- 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
- yes
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 90
- Smith Number
- yes
- 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
- Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6.at n=30A000292
- Number of permutations of an n-sequence discordant with three given permutations (see reference) in n-1 places.at n=3A000476
- Sum of the first n even squares: a(n) = 2*n*(n+1)*(2*n+1)/3.at n=15A002492
- Binomial coefficient C(4n,n-5).at n=3A004335
- Binomial coefficient C(8n, n-1).at n=3A004382
- a(n) = Sum_{k=1..n-1} lcm(k,n-k).at n=31A006580
- Coordination sequence T7 for Zeolite Code EUO.at n=44A008102
- Coordination sequence T8 for Zeolite Code EUO.at n=44A008103
- Coordination sequence T6 for Zeolite Code NES.at n=45A008210
- Binomial coefficient C(32,n).at n=3A010948
- Binomial coefficient C(n,29).at n=3A010982
- a(n) = floor(n*(n-1)*(n-2)/30).at n=54A011912
- Even tetrahedral numbers.at n=22A015220
- a(n) = 2^n*(2^n - 1)*(2^n - 2)/6.at n=5A026740
- Sequence satisfies T(a)=a, where T is defined below.at n=49A027597
- a(n) = (prime(n)-3)*(prime(n)-5)*(prime(n)-7)/48.at n=17A030003
- Duplicate of A002492.at n=15A035007
- Number of connected graphs on n unlabeled nodes where every block is a complete graph.at n=11A035053
- Number of partitions of n into parts not of the form 19k, 19k+8 or 19k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=30A035977
- a(n) = n*(2*n^2 - 3*n + 4)/3.at n=20A037235