10576
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 20522
- Proper Divisor Sum (Aliquot Sum)
- 9946
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5280
- Möbius Function
- 0
- Radical
- 1322
- Omega Function (Ω)
- 5
- 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
- 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
- Convolution of A023532 and Lucas numbers.at n=17A023597
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5, with initial values 1,0,1,0.at n=16A025275
- Number of n-move self-avoiding knight paths on 5 X 5 board, beginning at corner.at n=9A025589
- Number of subgroups of index n in fundamental group of a certain fiber space.at n=5A027842
- Triangle read by rows: this is a variant of A008280 in which 2 rows go from left to right, 2 from right to left, 2 from left to right, etc.at n=65A058257
- The 2-Up sequence: formed from final entries in rows of A058257.at n=10A058258
- Number of anisohedral polyhexes with n cells.at n=15A075215
- Expansion of (5 - 9*x + 6*x^2)/(1-x)^4.at n=31A080957
- a(n) = 2^n for n = 0..4; for n > 4, a(n) = 2*a(n-1) + a(n-5).at n=13A098588
- Number of compositions of n into 5 parts such that no two adjacent parts are equal.at n=20A106354
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=26A181883
- Number of 8-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=6A187161
- Number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements.at n=1A203788
- Number of (n+1) X 3 0..3 arrays with every 2 X 2 subblock having equal diagonal elements or equal antidiagonal elements.at n=1A203790
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements.at n=4A203796
- The maximum possible number of rooted triples consistent with any galled-tree (level-1 phylogenetic network) containing exactly n leaves.at n=36A216499
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..2 array extended with zeros and convolved with 1,-2,1.at n=16A222147
- Number T(n,k) of k up, k down permutations of [n]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=57A229892
- Number of partitions p of n such that the m(M(p)) is a part, where m = multiplicity, M = the minimum multiplicity of the parts of p.at n=38A240539
- Number of twin-tree-rooted maps with n edges.at n=5A260041