11417
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 13338
- Proper Divisor Sum (Aliquot Sum)
- 1921
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9744
- Möbius Function
- 0
- Radical
- 1631
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 11 (most significant digit on left).at n=21A029480
- "DFK" (bracelet, size, unlabeled) transform of 2,1,1,1...at n=32A032215
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=15A049896
- Number of words with n letters in the National Scrabble Association Dictionary.at n=10A124015
- Expansion of q^(-3/4) * eta(q)^2 * eta(q^2)^4 * eta(q^8)^4 / eta(q^4)^6 in powers of q.at n=36A135467
- Conjectured positive numbers which have more than one representation (m,s) as a difference s^2 - m^5, m >= 1, s > 0.at n=27A177770
- Number of cubic plane graphs with 2n nodes, minimal face size 4 and maximal face size 6.at n=24A219748
- Number of Weyl group elements, not containing an s_1 factor, which contribute nonzero terms to Kostant's weight multiplicity formula when computing the multiplicity of the zero-weight in the adjoint representation for the Lie algebra of type D and rank n.at n=10A234597
- G.f.: (1 + x^4 + x^5 + x^6 + x^10 + x^11 + x^12 + x^16)/Product_{i=1..8} (1 - x^i).at n=33A256975
- a(n) = A033148(n) / 2^floor(n/4).at n=35A260189
- Numbers n such that n^2048 + (n+1)^2048 is prime.at n=14A274235
- Triangle read by rows: T(n,k) = number of ways of partitioning the (n+2)-element multiset {1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 2.at n=48A291117
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + n*b(n), where a(0) = 1, a(1) = 4, b(0) = 2, b(1) = 3, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=13A296295
- a(n) = a(n-1) + a(n-2) + 2 a(floor(n/2)) + 3 a(floor(n/3)) + ... + n a(floor(n/n)), where a(0) = 1, a(1) = 2, a(2) = 3.at n=13A298370
- Expansion of Product_{j>=1} (1 + (-1 + Product_{k>=1} (1 + x^k))^j).at n=11A307128
- a(n) = Sum_{k=0..floor(3*n/14)} binomial(3*n-13*k,k).at n=24A392351