10442
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
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 5974
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4972
- Möbius Function
- -1
- Radical
- 10442
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of exp(tanh(x)*sin(x)).at n=5A009270
- Expansion of (3+2*x^2)/(1-x)^4.at n=22A037236
- Coefficients of monic primitive irreducible polynomials over GF(5) listed in lexicographic order.at n=32A058950
- Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.at n=19A078612
- Row sums of the triangle described in A082200.at n=22A082203
- Riordan array (1/(1-2*x), x*(1+x)/(1-2*x)).at n=49A121574
- Riordan array ((1-x)/(1-3*x), x*(1-x)/(1-3*x)).at n=49A125693
- a(n) = n*(5*n-3).at n=46A135706
- a(n) = p^2 - sum of digits of p^p, where p = prime(n).at n=27A140499
- Number of (w,x,y,z) with all terms in {0,...,n} and 2w-x=max{w,x,y,z}-min{w,x,y,z}.at n=27A212756
- Number of n X 3 0..1 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..1 introduced in row major order.at n=6A240778
- T(n,k)=Number of nXk 0..1 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..1 introduced in row major order.at n=42A240783
- Number of 7 X n 0..1 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..1 introduced in row major order.at n=2A240788
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 182", based on the 5-celled von Neumann neighborhood.at n=29A270632
- Numbers n such that Bernoulli number B_{n} has denominator 282.at n=28A272184
- G.f.: Product_{k>=1, j>=1} 1/(1 - x^(j*k^4)).at n=33A280662
- Compound filter: a(n) = P(A257993(n), A278226(n)), where P(n,k) is sequence A000027 used as a pairing function.at n=27A286382
- Compound filter (2-adic valuation & sum of the divisors): a(n) = P(A001511(n), A000203(n)), where P(n,k) is sequence A000027 used as a pairing function.at n=65A286460
- a(n) is the sum of the base-b representations of n for 2 <= b <= n+1 read in base ten.at n=16A289335
- a(n) = n^2 * (n + 1)/2 - Sum_{k=1..n} sigma_2(k).at n=47A309176