1327
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1328
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 1326
- Möbius Function
- -1
- Radical
- 1327
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 217
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that divide at least one term in every Fibonacci sequence.at n=44A000057
- Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.at n=51A000124
- a(0)=2; for n>=1, a(n) = smallest prime p such that there is a gap of exactly 2n between p and next prime, or -1 if no such prime exists.at n=17A000230
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=19A000923
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/6.at n=7A001136
- Primes (lower end) with record gaps to the next consecutive prime: primes p(k) where p(k+1) - p(k) exceeds p(j+1) - p(j) for all j < k.at n=9A002386
- Schur's 1926 partition theorem: number of partitions of n into parts 6n+1 or 6n-1.at n=63A003105
- Divisible only by primes congruent to 4 mod 7.at n=39A004622
- Coordination sequence T1 for Zeolite Code AEL.at n=24A008004
- Coordination sequence T2 for Zeolite Code AEL.at n=24A008005
- Coordination sequence T1 for Zeolite Code NON.at n=22A008212
- Expansion of (1+x^7)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=44A008768
- Coordination sequence T1 for Zeolite Code -CLO.at n=32A009850
- Coordination sequence T3 for Zeolite Code RUT.at n=24A009899
- Integers that are squarefree and also the sum of first k squarefrees for some k.at n=22A013932
- Primes of the form x^2 + 27y^2.at n=28A014752
- Numbers n such that phi(n + 9) | sigma(n) for n not congruent to 0 (mod 3).at n=27A015849
- Numbers k=3*m+1 such that 2^m == 1 (mod k).at n=29A016108
- Primes p such that 4*p+1 is also prime.at n=39A023212
- Primes p such that 7*p + 4 is also prime.at n=39A023224