12608
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 14
- Divisor Sum
- 25146
- Proper Divisor Sum (Aliquot Sum)
- 12538
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6272
- Möbius Function
- 0
- Radical
- 394
- Omega Function (Ω)
- 7
- 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
- 32
- 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
- [ (4th elementary symmetric function of S(n))/(2nd elementary symmetric function of S(n)) ], where S(n) = {first n+3 positive integers congruent to 1 mod 3}.at n=14A024223
- 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 55.at n=33A031553
- Numerators of continued fraction convergents to sqrt(810).at n=6A042562
- a(n) = (4*4^n + (-6)^n)/5.at n=6A083297
- Smallest multiple of prime(n) of the form r*prime(n-1) + s*prime(n-2). r and s are positive integers.at n=42A085950
- Schroeder paths with two rise colors and two level colors.at n=5A156017
- Partial sums of A023200.at n=35A172112
- a(n) is the smallest positive integer that, when written in binary, contains the binary representations of both the n-th prime and the n-th composite as (possibly overlapping) substrings.at n=44A175349
- Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1 + 2*x)/(1 - 6*x - 2*x^2).at n=5A180029
- Triangle T(n,k) for A(x)^k=sum(n>=k T(n,k)*x^n), where o.g.f. A(x) satisfies A(x)=(a+b*x*A(x))/(c-d*x*A(x)), a=1,b=2,c=1,d=2.at n=15A183875
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210861; see the Formula section of A210861.at n=37A210860
- Triangular array read by rows: row n shows the coefficients of the polynomial u(n) = c(0) + c(1)*x + ... + c(n)*x^(n) which is the numerator of the n-th convergent of the continued fraction [k, k, k, ... ], where k = x + 1/2.at n=38A231730
- Number of partitions p of n such that the number of parts is not a part and max(p) - min(p) is a part.at n=44A241383
- Least k starting a chain or (2n+1)-tuple of consecutive integers {h(k+i)}, i=0,1,...,2n (excluding the trivial chain when h(k) = h(k+1) = ... = h(k+2n)) with symmetrical gaps about the center, where h(k) is the length of the finite set {k, f(k), f(f(k)),...,1} in the Collatz (or 3x + 1) problem.at n=3A268468
- Number of permutations of [n] avoiding {4231, 1423, 1234}.at n=10A294765
- a(n) = Sum_{k=1..n} floor(n/k)^3.at n=21A318742
- Expansion of Product_{k>=1} (1 + x^k)^(d(k)-1), where d(k) = number of divisors of k (A000005).at n=38A318844
- Number of compositions of n with strictly increasing differences.at n=42A325547
- Number of maximal subsets of {1..n} such that every orderless pair of distinct elements has a different sum.at n=23A325878
- Number of integer partitions of n with more than one non-co-mode.at n=36A363128