10808
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23280
- Proper Divisor Sum (Aliquot Sum)
- 12472
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 2702
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 161
- 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
- Expansion of sinh(x)*cos(log(1+x)).at n=8A009618
- Coordination sequence for MgCu2, Mg position.at n=26A009931
- Numbers such that ten iterations of Reverse and Add are needed to reach a palindrome.at n=17A015991
- Numbers k such that the period of the continued fraction for sqrt(3)*k is 2.at n=49A064933
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=16A065215
- Sum of products of terms in all partitions of n into odd parts.at n=20A067553
- Antidiagonal sums of table A083362.at n=27A083364
- Number of right triangles with nonnegative integer coordinates less than or equal to n and one corner at the origin.at n=44A155154
- a(n) = 169*n^2 - n.at n=7A157998
- a(n) = 676*n^2 - 2*n.at n=3A158392
- a(n) = 64*n^2 - 8.at n=12A158487
- Number of binary strings of length n with equal numbers of 00001 and 01000 substrings.at n=14A164197
- Number of distinct 5-card poker hands using n ranks and 4 unlabeled suits.at n=8A181430
- G.f.: sqrt( Sum_{n>=0} 4^n*x^(n^2) ).at n=11A227293
- Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (8,n)-rectangular grid with k '1's and (8n-k) '0's: two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=32A228167
- Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (8,n)-rectangular grid with k '1's and (8n-k) '0's: two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=46A228167
- Number of n X 2 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=10A240266
- Table T(n,k), n>=1, k>=1, read by antidiagonals: T(n,k) = number of equivalence classes of ways of placing five 1 X 1 tiles in an n X k rectangle under all symmetry operations of the rectangle.at n=47A248017
- Table T(n,k), n>=1, k>=1, read by antidiagonals: T(n,k) = number of equivalence classes of ways of placing five 1 X 1 tiles in an n X k rectangle under all symmetry operations of the rectangle.at n=52A248017
- a(n) = Sum_{k=3..n} k*StirlingS2(n+1, k+1).at n=4A266696