1317
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1760
- Proper Divisor Sum (Aliquot Sum)
- 443
- 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
- 876
- Möbius Function
- 1
- Radical
- 1317
- 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
- Related to Zarankiewicz's problem.at n=49A001841
- Prime numbers of measurement.at n=34A002049
- Number of distinct autocorrelations of binary words of length n.at n=42A005434
- Juxtapose pairs of primes (starting at 1).at n=3A007794
- Coordination sequence T6 for Zeolite Code MFI.at n=23A008169
- Numbers k such that the continued fraction for sqrt(k) has period 30.at n=11A020369
- Numbers k such that Fibonacci(k) == 2 (mod k).at n=24A023174
- Numbers with exactly 3 2's in base 5 expansion.at n=40A023732
- a(n) = floor(C(4n,2n)/C(4n,n)).at n=14A024501
- a(n) = Sum_{k=1..n} (n-k) * floor(n/k).at n=22A024920
- a(n) = sum of the numbers between the two n's in A026280.at n=32A026283
- Number of partitions of n into an even number of parts, the greatest being 5; also, a(n+9) = number of partitions of n+4 into an odd number of parts, each <=5.at n=49A026929
- Golc sequence in base 2. Left to right concatenation of n,int(log_2(n)),int(log_2(int(log_2(n)))),... in base 2.at n=19A028432
- Numbers having period-2 4-digitized sequences.at n=35A031184
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 24.at n=8A031522
- Numbers k such that 65*2^k+1 is prime.at n=21A032382
- Concatenation of n and n + 4 or {n,n+4}.at n=12A032609
- Concatenations C1 and C2 are both prime (see the comment lines).at n=43A034813
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 3 (mod 5).at n=45A035583
- Number of partitions of n into parts 4k+2 and 4k+3 with at least one part of each type.at n=49A035626