10611
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 15972
- Proper Divisor Sum (Aliquot Sum)
- 5361
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7020
- Möbius Function
- 0
- Radical
- 393
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 99
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions satisfying (cn(0,5) = 0 and cn(2,5) <= cn(1,5) and cn(3,5) <= cn(1,5) and cn(2,5) <= cn(4,5) and cn(3,5) <= cn(4,5)).at n=47A036806
- Odd numbers with exactly 5 palindromic prime factors (counted with multiplicity).at n=35A046375
- The second of the three sequences associated with the polynomial x^3 - 2.at n=13A052102
- p^2 + 2 where p is a prime.at n=26A061725
- Minimal k > n such that (4k+3n)(4n+3k) is a square.at n=26A083752
- Numbers n such that the perfect deficiency of n (A109883) equals the perfect deficiency of n + 1.at n=0A110018
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UUUU's starting at level 0.at n=30A135309
- Union of A052103, A052102 and A052101, uniqued and sorted.at n=31A140495
- 3 times 12-gonal (or dodecagonal) numbers: a(n) = 3*n*(5*n-4).at n=27A153448
- a(n) = (6 + 10*n + 5*n^2 + n^3)/2.at n=26A164845
- Number of n-bead necklaces labeled with numbers 1..7 not allowing reversal, with no adjacent beads differing by more than 1.at n=10A208776
- Number of ordered triples (i,j,k) with |i|,|j|,|k|,|i*j*k| <= n and gcd(i,j,k) <= 1.at n=33A226357
- Numbers k such that antisigma(k) mod k = antisigma(k+1) mod (k+1).at n=6A229114
- Coefficients in expansion of graph zeta function of graph obtained by adding 4 vertices to each edge of K_5.at n=8A240806
- Partial sums of A073602.at n=31A259035
- Numbers n such that n*2^1279 - 1 is prime.at n=26A265502
- G.f.: (1 + x + 3*x^2 + 11*x^3 + 6*x^4 + 14*x^5 + 12*x^6 + 4*x^7 + 14*x^8 + 4*x^9 + 12*x^10 + 14*x^11 + 5*x^ 12 + 11*x^13 + 9*x^14 - 11*x^15)/((1 - x)^4*(1 - x^2)^12).at n=7A268244
- Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having k peaks of width 1 (i.e., UHD configurations, where U=(0,1), H(1,0), D=(0,-1)), (n>=2, k>=0).at n=30A273715
- a(n) is the sum of a sequence of multiples of the n-th prime such that it contains each of the digits from 0 to 9 exactly once and with the least sum possible, or 0 if there is no satisfying sequence.at n=31A274328
- Number of n X 5 0..1 arrays with every element equal to 0, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=17A298914