11627
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14592
- Proper Divisor Sum (Aliquot Sum)
- 2965
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9000
- Möbius Function
- -1
- Radical
- 11627
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 174
- 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
- no
- Odd
- yes
Appears in sequences
- Divisors of 2^30 - 1.at n=40A003538
- Numbers such that ten iterations of Reverse and Add are needed to reach a palindrome.at n=27A015991
- a(n) = (2*n+1) * (4*n-1).at n=38A033566
- Gaps of 9 in sequence A038593 (upper terms).at n=8A038658
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= (n-2)/3.at n=18A048016
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= (n-3)/3.at n=18A048027
- a(n) = binomial(n+6,5) - 1.at n=13A062988
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=26A065215
- Numbers n such that n+2*prime(n) is a perfect square.at n=32A104776
- Triangle read by rows: T(n,k) is the number of ordered trees with n edges having k even-length branches starting at the root (0<=k<=n).at n=52A127541
- Positive integers of the form (6*m^2 + 1)/11.at n=26A179337
- G.f. satisfies: A(x) = exp( Sum_{n>=1} (Sum_{k=0..2*n} A027907(n,k)^2 * x^k * A(x)^(2*k)) * x^n*A(x)^n/n ), where A027907 is the triangle of trinomial coefficients.at n=7A200475
- Number of (w,x,y) with all terms in {0,...,n} and x != min(|w-x|, |x-y|).at n=22A213502
- Beastly reciprocals, or numbers k such that digitsum(1/k) = 666.at n=25A244661
- Numbers M(n) which are the number of terms in the sums of consecutive cubed integers equaling a squared integer, b^3 + (b+1)^3 + ... + (b+M-1)^3 = c^2, for a first term b(n) being an odd squared integer (A016754).at n=10A253707
- Expansion of Product_{k>=1} 1/(1-x^(k+4))^k.at n=33A263360
- Regular triangle where T(n,k) is the number of enriched p-trees of weight n with k leaves.at n=62A301364
- G.f. A(x) satisfies: [x^n] A(x)^(n*(n+1)-1) / (x*A(x)^n)' = 0 for n>1.at n=4A302060
- Number of non-isomorphic phylogenetic trees with n nodes.at n=21A330627
- Let t_k denote the triangular number k*(k+1)/2. Suppose 0 < x < y < z are integers satisfying t_x + t_y = t_p, t_y + t_z = t_q, t_x + t_z = t_r, for integers p,q,r. Sort the triples [x,y,z] first by x, then by y. Sequence gives the values of z.at n=36A332590