10564
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19600
- Proper Divisor Sum (Aliquot Sum)
- 9036
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4968
- Möbius Function
- 0
- Radical
- 5282
- Omega Function (Ω)
- 4
- 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
- 104
- 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
- Number of n-dimensional partitions of 5.at n=18A008779
- Number of compositions (ordered partitions) of n into 1's, 3's and 5's.at n=22A060961
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=39A090495
- The sum of a triangular array made from a negative 6 fold permutation product with shifts up and down of {2,6}.at n=32A105162
- a(n) = 5*n^2 + 20*n + 4.at n=43A134547
- An Ulam-type sequence: a(n) = n if n<=10; for n>10, a(n) = least number > a(n-1) which is a unique sum of 10 distinct earlier terms.at n=49A183533
- Number of arrangements of n+2 nonzero numbers x(i) in -7..7 with the sum of x(i)*x(i+1) equal to zero.at n=2A188247
- T(n,k)=Number of arrangements of n+2 nonzero numbers x(i) in -k..k with the sum of x(i)*x(i+1) equal to zero.at n=38A188249
- Number of arrangements of 5 nonzero numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=6A188251
- Positions of the incrementally largest terms in the continued fraction expansion of zeta(3).at n=14A229055
- Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and with no two consecutive increases.at n=9A263639
- p-INVERT of the upper Wythoff sequence (A001950), where p(S) = 1 - S - S^2.at n=5A289926
- Number of labeled graphs on n vertices that are first-player-winning in the game of Col.at n=5A291342
- Number of n X 2 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 0 or 2 neighboring 1s.at n=9A296329
- Difference between maximum and minimum sum of products of successive pairs in permutations of [n].at n=39A306262
- a(n) = Sum_{i=1..n, j=1..n, gcd(i,j)=1} i.at n=31A333297
- Even composite integers m such that A004254(m)^2 == 1 (mod m).at n=21A338314
- Consider primitive pairs of integers (b, c) with b > 0 such that x^5 + b*x + c = 0 is irreducible and solvable by radicals: sequence gives values of b.at n=21A371553
- Consider primitive pairs of integers (b, c) with b > 0 such that x^5 + b*x + c = 0 is irreducible and solvable by radicals: sequence gives values of b.at n=22A371553