1324
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 2324
- Proper Divisor Sum (Aliquot Sum)
- 1000
- 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
- 660
- Möbius Function
- 0
- Radical
- 662
- Omega Function (Ω)
- 3
- 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
- no
- 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 degree-n even permutations of order dividing 2.at n=9A000704
- Convolved Fibonacci numbers.at n=7A001872
- Number of 3 X n binary matrices up to row and column permutations.at n=8A002727
- Related to Euler numbers, expansion of e.g.f. sec(x)*tan^2(x).at n=4A002735
- Number of n-step self-avoiding walks on b.c.c. lattice (version 1).at n=4A002903
- Number of down-up permutations of n+3 starting with n+1.at n=6A006212
- Cald's sequence: a(n+1) = a(n) - prime(n) if that value is positive and new, otherwise a(n) + prime(n) if new, otherwise 0; start with a(1)=1.at n=126A006509
- Coordination sequence T1 for Zeolite Code ABW and ATN.at n=25A008000
- Coordination sequence T2 for Zeolite Code MTW.at n=24A008197
- Coordination sequence T1 for Zeolite Code VFI.at n=28A008245
- Coordination sequence T2 for Zeolite Code VFI.at n=28A008246
- Coordination sequence for diamond.at n=23A008253
- Coordination sequence T2 for Scapolite.at n=23A008263
- Boustrophedon version of triangle of Euler-Bernoulli or Entringer numbers read by rows.at n=38A008280
- Triangle of Euler-Bernoulli or Entringer numbers read by rows.at n=42A008281
- Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1.at n=33A008282
- Read across rows of Euler-Bernoulli or Entringer triangle.at n=20A008283
- Crystal ball sequence for planar net 4.8.8.at n=31A008577
- Expansion of e.g.f.: tan(log(1+x))*log(1+x).at n=6A009645
- Coordination sequence T2 for Zeolite Code -CLO.at n=33A009851