3264
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
- 3
Divisibility
- Divisor Count
- 28
- Divisor Sum
- 9144
- Proper Divisor Sum (Aliquot Sum)
- 5880
- 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
- 1024
- Möbius Function
- 0
- Radical
- 102
- Omega Function (Ω)
- 8
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 30
- 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
- Expansion of Product_{m >= 1} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts.at n=49A000009
- Number of ways of writing n as a sum of 6 squares.at n=14A000141
- Number of n-input 2-output switching networks under action of symmetric group S(n) on the inputs and complementing group C(2,2) on the outputs.at n=2A000841
- Double-bitters: only even length runs in binary expansion.at n=40A001196
- Susceptibility series for b.c.c. lattice.at n=12A002925
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals up to rotation.at n=31A003451
- a(0) = 1, a(1) = 2, for n > 1, a(n) = 4*a(n-1) - 2*a(n-2).at n=7A003480
- Number of walks of length 2n+8 in the path graph P_9 from one end to the other.at n=4A005024
- If n mod 2 = 0 then n*(n^2-4)/12 else n*(n^2-1)/12.at n=34A006584
- Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.at n=37A007077
- Theta series of {D_6}* lattice.at n=28A008425
- Theta series of D_6 lattice.at n=7A008428
- Theta series of {D_6}^{+} lattice.at n=28A008434
- a(n) = floor( n*(n-1)*(n-2)/11 ).at n=34A011893
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MAZ = Mazzite (Na2,K2,Ca,Mg)5[Al10Si26O72].28H2O starting from a T1 atom.at n=11A019142
- a(n) is the concatenation of n and 2n.at n=31A019550
- Let a,b,c,...k be all divisors of n; a(n) = (a+1)*(b+1)*...*(k+1).at n=32A020696
- Pisot sequence P(2,7): a(0)=2, a(1)=7, thereafter a(n+1) is the nearest integer to a(n)^2/a(n-1).at n=6A020727
- Duplicate of A020727.at n=6A021000
- Coordination sequence for root lattice B_8.at n=2A022150