10262
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
- 17616
- Proper Divisor Sum (Aliquot Sum)
- 7354
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4392
- Möbius Function
- -1
- Radical
- 10262
- 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
- If a, b in sequence, so is ab+10.at n=40A009368
- Coordination sequence for CaF2(1), F position.at n=34A009924
- Self-convolution of array T given by A026670.at n=7A026981
- Numerators of continued fraction convergents to sqrt(385).at n=10A041730
- For even k >= 4, let f(k) = A066285(k/2) be the minimal difference between primes p and q whose sum is k. Such a k is in the sequence if f(k) > f(m) for all even m with 4 <= m < k.at n=24A065978
- Half the number of (n+2) X 3 binary arrays with each 3 X 3 subblock having sum 3, 4, 5 or 6.at n=2A187309
- Half the number of (n+2) X 5 binary arrays with each 3 X 3 subblock having sum 3, 4, 5 or 6.at n=0A187311
- T(n,k)=Half the number of (n+2)X(k+2) binary arrays with each 3X3 subblock having sum 3, 4, 5 or 6.at n=3A187317
- T(n,k)=Half the number of (n+2)X(k+2) binary arrays with each 3X3 subblock having sum 3, 4, 5 or 6.at n=5A187317
- Number of (n+2)X(6+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=9A254905
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 318", based on the 5-celled von Neumann neighborhood.at n=28A271252
- Number of same-trees of weight n.at n=19A281145
- Expansion of Product_{k>=1} ((1 + x^(4*k)) / (1 - x^k)).at n=30A285472
- Number of connected undirected unlabeled loopless multigraphs with 4 vertices and n edges.at n=28A290778
- Let n be even; m = n/2 and p a prime such that p<=m with n-p nonprime. The sequence contains the successive positive maxima of values n with L = primepi(m-1)-primepi(p+1)> 0.at n=14A293858
- Triangle read by rows: T(n,m) = Sum_{k=m+1..n} (n-1)!/(k-1)!*binomial(2*n-k-1, n-1)*E(k,m) where E(n,m) is Euler's triangle A173018, T(0,0) = 1, n >= m >= 0.at n=23A316773
- a(n) = 1*2*3 - 4*5*6 + 7*8*9 - 10*11*12 + 13*14*15 - ... + (up to n).at n=27A319543
- Number of compositions of n whose Lyndon and co-Lyndon factorizations both have the same length.at n=16A329394
- a(n) = Sum_{k=1..n} gcd(k,n)^(n/gcd(k,n) - 1).at n=21A342437
- G.f. A(x) satisfies A(x) = 1/sqrt( (1 - 2*x) * (1 - 2*x*A(x)) ).at n=7A379329