3281
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3492
- Proper Divisor Sum (Aliquot Sum)
- 211
- 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
- 3072
- Möbius Function
- 1
- Radical
- 3281
- Omega Function (Ω)
- 2
- 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
- 74
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Centered square numbers: a(n) = 2*n*(n+1)+1. Sums of two consecutive squares. Also, consider all Pythagorean triples (X, Y, Z=Y+1) ordered by increasing Z; then sequence gives Z values.at n=40A001844
- Octahedral numbers: a(n) = n*(2*n^2 + 1)/3.at n=17A005900
- Pseudoprimes to base 3.at n=14A005935
- Expansion of (1+x^2)/((1-x)^2*(1-x^2)^2).at n=32A005993
- a(n) = (3^n + 1)/2.at n=8A007051
- Number of functors of degree n from free Abelian groups to Abelian groups.at n=4A007322
- Difference between the number of 5-dimensional partitions of n and an approximation derived from binomial(n,4).at n=9A007328
- Coordination sequence T4 for Zeolite Code FER.at n=35A008109
- Coordination sequence for alpha-Mn, Position Mn2.at n=15A009951
- Conjectured formula for irreducible 6-fold Euler sums of weight 2n+16.at n=19A019459
- Pseudoprimes to base 9.at n=32A020138
- Pseudoprimes to base 27.at n=28A020155
- Pseudoprimes to base 43.at n=39A020171
- Pseudoprimes to base 50.at n=31A020178
- Strong pseudoprimes to base 3.at n=3A020229
- Strong pseudoprimes to base 9.at n=8A020235
- Strong pseudoprimes to base 27.at n=7A020253
- Strong pseudoprimes to base 43.at n=6A020269
- Strong pseudoprimes to base 81.at n=12A020307
- Number of strong elementary edge-subgraphs in Moebius ladder M_n.at n=8A020880