8321
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
- 8532
- 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
- 8112
- Möbius Function
- 1
- Radical
- 8321
- 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
- 52
- 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
- Strong pseudoprimes to base 2.at n=4A001262
- Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers.at n=19A001567
- Numbers that are the sum of 5 positive 6th powers.at n=38A003361
- Pseudoprimes to base 7.at n=15A005938
- Euler pseudoprimes: composite numbers n such that 2^((n-1)/2) == +-1 (mod n).at n=12A006970
- Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=9A006971
- Coordination sequence for sigma-CrFe, Position Xb.at n=23A009960
- Odd octagonal numbers: (2n+1)*(6n+1).at n=26A014641
- Numbers n such that n is a substring of its square (both n and n squared in base 4) (written in base 10).at n=23A018828
- Fermat pseudoprimes to base 4.at n=38A020136
- Pseudoprimes to base 14.at n=30A020142
- Pseudoprimes to base 28.at n=30A020156
- Pseudoprimes to base 29.at n=41A020157
- Pseudoprimes to base 39.at n=22A020167
- Pseudoprimes to base 41.at n=43A020169
- Pseudoprimes to base 45.at n=41A020173
- Pseudoprimes to base 54.at n=29A020182
- Pseudoprimes to base 56.at n=37A020184
- Pseudoprimes to base 58.at n=34A020186
- Pseudoprimes to base 59.at n=35A020187