2464
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 6048
- Proper Divisor Sum (Aliquot Sum)
- 3584
- 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
- 960
- Möbius Function
- 0
- Radical
- 154
- 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
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 27
- 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
- Rencontres numbers: number of permutations of [n] with exactly 3 fixed points.at n=5A000449
- Coordination sequence T3 for Zeolite Code MEI.at n=36A008148
- Coordination sequence T3 for Zeolite Code MTN.at n=30A008188
- Coordination sequence T2 for Zeolite Code NON.at n=30A008213
- Triangle T(n,k) of rencontres numbers (number of permutations of n elements with k fixed points).at n=39A008290
- Triangle of rencontres numbers.at n=24A008291
- Triangle T(n,k) of arctangent numbers: expansion of arctan(x)^n/n!.at n=17A008309
- a(n+1) = a(n)-b(n+1) if a(n) >= b(n+1) else a(n)+b(n+1), where {b(n)} are the triangular numbers A000217.at n=54A008345
- Molien series for alternating group Alt_8 (or A_8).at n=30A008631
- Coordination sequence T1 for Zeolite Code CON.at n=35A009868
- Coordination sequence T1 for Zeolite Code VET.at n=30A009902
- Coordination sequence for alpha-Mn, Position Mn4.at n=13A009953
- Coordination sequence T3 for Zeolite Code CZP.at n=32A019458
- Number of single component edge-subgraphs in Moebius ladder M_n.at n=2A020868
- Number of partitions of n into parts of 8 kinds.at n=5A023007
- Numbers that are the sum of 4 distinct positive cubes in exactly 2 ways.at n=34A025409
- Numbers that are the sum of 4 distinct positive cubes in 2 or more ways.at n=38A025412
- dot product (n,n-1,...2,1).(3,4,...,n,1,2).at n=19A026054
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0 = s(n), |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4. Also a(n) = T(n,n), where T is the array defined in A026082.at n=6A026083
- Self-convolution of array T given by A027144.at n=4A027156