10424
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19560
- Proper Divisor Sum (Aliquot Sum)
- 9136
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5208
- Möbius Function
- 0
- Radical
- 2606
- Omega Function (Ω)
- 4
- 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
- 104
- 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
- Numerators of continued fraction convergents to sqrt(781).at n=7A042506
- Expansion of 1/sqrt(1-8*x-4*x^2).at n=5A098443
- Sums of rows of the triangle in A116366.at n=39A116367
- Exponential Riordan array (e^(x(1+x)),x).at n=37A122832
- Number of cubic equations ax^3 + bx^2 + cx + d = 0 with integer coefficients |a|,|b|,|c|,|d| <= n, a <> 0, having three real roots, of which at least two are equal.at n=36A155192
- Numbers k such that k^2 == 2 (mod 23^2).at n=39A156849
- Number of ways of partitioning the multiset {1,1,1,2,3,...,n-2} into exactly three nonempty parts.at n=8A168605
- Second terms "b" of quadruples a>b>c>d>0 with six square pairwise sums.at n=39A175536
- Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having four distinct values for every i,j,k<=n.at n=11A211720
- Smallest number m such that A176352(m) = n.at n=40A218454
- Least positive integer k such that prime(k*n)+2 = prime(i*n)*prime(j*n) for some 0 < i < j.at n=26A257926
- Expansion of exp(x*arcsin(x)) (even powers only).at n=4A259647
- Irregular symmetric triangle of coefficients T(n,k) of the polynomials p(n,x) = Sum_{k=0..n} binomial(n+1,k)*(1+x)^(2*k)*(-x)^(n-k) for 0 <= k <= 2*n.at n=55A264766
- Irregular symmetric triangle of coefficients T(n,k) of the polynomials p(n,x) = Sum_{k=0..n} binomial(n+1,k)*(1+x)^(2*k)*(-x)^(n-k) for 0 <= k <= 2*n.at n=57A264766
- Triangle read by rows: T(n,k) = number of ways of partitioning the (n+2)-element multiset {1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 2.at n=56A291117
- Column 1 of A122832.at n=8A291632
- Partial sums of A230584.at n=47A298375
- Numbers k such that k^2+1, (k+2)^2+1 and (k+6)^2+1 are prime.at n=21A302021
- Number of integer partitions of n whose number of submultisets is less than n.at n=49A325833
- Number of integer partitions of n whose number of submultisets is less than or equal to n.at n=49A325834