11682
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 28080
- Proper Divisor Sum (Aliquot Sum)
- 16398
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3480
- Möbius Function
- 0
- Radical
- 3894
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 81
- 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
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=85A013583
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 12.at n=18A031690
- Number of conjugacy classes of elements of order n in E_8(C).at n=27A045514
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Sequence gives values of z in monotonic increasing order.at n=16A050791
- Split positive integers into extending even groups and sum: 1+2, 3+4+5+6, 7+8+9+10+11+12, 13+14+15+16+17+18+19+20, ...at n=18A061317
- Triangle read by rows: T(n,k) = n*T(n-1,k-1) + k*T(n-1,k) starting with T(0,0)=1.at n=39A078341
- a(n) = (29*3^n - 18(n + 3)*2^n + 6n^2 + 24n + 27)/12.at n=7A103768
- Let f(k) = exp(Pi*sqrt(k)); sequence gives numbers k such that ceiling(f(k)) - f(k) < 1/10^3.at n=25A127022
- Subsequence of 'Fermat near misses' which is generated by a simple formula based on the cubic binomial expansion along with formulas for the corresponding terms in the expression, x^3 + y^3 = z^3 + 1.at n=5A141326
- Twice 13-gonal numbers: a(n) = n*(11*n - 9).at n=33A152997
- a(n) = 36*n^2 + n.at n=17A157324
- a(n) = 1458*n + 18.at n=7A157505
- 144n^2 + 2n.at n=8A158132
- a(n) = 324*n^2 + 18.at n=6A158590
- Take the left or right binary concatenation of the numbers 1 to n, whichever is greater, delete digits identical to corresponding digits in the other concatenation, condense the remaining digits, and convert to decimal.at n=9A175910
- Square excess of Fibonacci numbers.at n=39A190993
- G.f. satisfies: A(x) = 1 + Sum_{n>=1} x^(n+1) * A(x)^n/(1 - x*A(x)^(2*n)).at n=11A192405
- Triangle of coefficients of polynomials u(n,x) jointly generated with A208762; see the Formula section.at n=52A208761
- Antidiagonal sums of the convolution array A213828.at n=10A213830
- Row sums of the triangular array A246694.at n=35A246695