10041
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13392
- Proper Divisor Sum (Aliquot Sum)
- 3351
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6692
- Möbius Function
- 1
- Radical
- 10041
- 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
- 65
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 100.at n=16A020439
- 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 66.at n=36A031564
- Numbers k such that the decimal part of k^(1/8) starts with a 'nine digits' anagram.at n=2A034283
- Decimal part of a(n)^(1/4) starts with reversal of its integer part: first term of runs.at n=9A034310
- Multiplicity of highest weight (or singular) vectors associated with character chi_22 of Monster module.at n=37A034410
- a(n) = a(n-1) + 2*a(floor(n/2)) if n > 0, otherwise 1.at n=26A058039
- a(n) = A053061(n)/n.at n=40A061082
- Divide n-th row of A084024 by n.at n=12A084025
- Numbers k such that for any single digit d of k the d-th semiprime sp(k) is substring of k.at n=18A135441
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 11100-00100-00111 pattern in any orientation.at n=12A147248
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, -1, 1), (1, -1, 0), (1, 1, 1)}.at n=8A149536
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, -1), (1, 0, -1), (1, 1, 1)}.at n=8A149537
- Positive integers of the form (2*m^2+1)/11.at n=42A179088
- Number of (n+1)X(1+1) 0..1 arrays x(i,j) with row sums sum{j*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=42A232825
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 137", based on the 5-celled von Neumann neighborhood.at n=25A270276
- Number of n X n 0..1 arrays with no 1 equal to more than two of its king-move neighbors.at n=3A282521
- Number of nX4 0..1 arrays with no 1 equal to more than two of its king-move neighbors.at n=3A282524
- T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than two of its king-move neighbors.at n=24A282528
- Numbers that are both binary palindromes and binary Smith numbers.at n=29A334530
- Semiprimes s = A001358(k) such that k, s - k and s + k are also semiprimes.at n=36A383468