10968
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27480
- Proper Divisor Sum (Aliquot Sum)
- 16512
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3648
- Möbius Function
- 0
- Radical
- 2742
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 117
- 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
- a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2 ) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).at n=17A023502
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5) < cn(1,5).at n=63A036858
- Expansion of (1-x)^(-1)/(1-2*x^2+x^3).at n=22A077880
- Consider the family of multigraphs enriched by the species of partitions. Sequence gives the triangle read by rows giving coefficients of polynomials arising from enumeration of those multigraphs on n edges.at n=31A098315
- Numbers that together with their prime factors contain every digit exactly once.at n=0A124668
- Numbers k such that binomial(5k, k) - 1 is prime.at n=14A125242
- Engel expansion of sqrt(7).at n=20A161368
- Number of ways to place 3 nonattacking knights on a 3 X n board.at n=14A172212
- Numbers k>1 such that phi(phi(k)) = sigma(sopf(k)).at n=40A173337
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210866; see the Formula section.at n=40A210867
- Number of (w,x,y,z) with all terms in {1,...,n} and w*x<=y*z+2.at n=12A212055
- Expansion of x^5/(x^6-x^4-x^2-x+1).at n=23A245437
- Number of solutions to 1 +- 5 +- 12 +- ... +- n*(3*n-1)/2 = 0.at n=25A292475
- Number of vertices at level n of the hyperbolic Pascal pyramid PP_(4,5).at n=11A293066
- Expansion of Product_{k>=1} (1 + x^k + x^(k^2)).at n=51A293253
- Numbers k such that (74*10^k + 133)/9 is prime.at n=19A293276
- Indices of primes followed by a gap (distance to next larger prime) of 42.at n=22A320719
- Expansion of (-1 + Product_{k>=1} (1 + x^k)^k)^3.at n=8A341385
- Numbers k for which A003958(sigma(k)) = 2*A003958(k), where A003958 is multiplicative with a(p^e) = (p-1)^e and sigma is the sum of divisors function.at n=38A351447
- Composite numbers with properties that its digits (which may appear with multiplicity) may not appear in any of its factors (wherein the digits may also appear with multiplicity) and the combined digits of the product and the factors must have at least one of each of the ten digits.at n=8A370972