11659
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11880
- Proper Divisor Sum (Aliquot Sum)
- 221
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11440
- Möbius Function
- 1
- Radical
- 11659
- Omega Function (Ω)
- 2
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 112
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Numbers k such that sigma(k) = sigma(k+4).at n=15A015863
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 21 ones.at n=3A031789
- Lucky numbers with size of gaps equal to 16 (upper terms).at n=36A031899
- a(n) = 8*n^2 + 88*n + 43.at n=33A086760
- G.f.: (1+x^3+x^4+x^5+x^6+x^9)/((1-x)*(1-x^2)^2*(1-x^3)*(1-x^4)).at n=37A090491
- a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4, with initial terms 1,-1,2,3.at n=21A111574
- Row sums of triangle A118788.at n=5A118789
- Values of n such that the expression sqrt(4!*(n+1) + 1) yields a perfect power.at n=8A144854
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 1, 1), (0, 1, 1), (1, -1, 0), (1, 0, -1)}.at n=8A149062
- Number of binary strings of length n with equal numbers of 00101 and 10010 substrings.at n=14A164247
- Positions of 2's in A171922.at n=25A171925
- Integers n such that for all i > n the largest prime factor of i(i+1)(i+2)(i+3)(i+4)(i+5) exceeds the largest prime factor of n(n+1)(n+2)(n+3)(n+4)(n+5).at n=17A193947
- Values of n such that L(18) and N(18) are both prime, where L(k) = (n^2+n+1)*2^(2*k) + (2*n+1)*2^k + 1, N(k) = (n^2+n+1)*2^k + n.at n=24A227521
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 355", based on the 5-celled von Neumann neighborhood.at n=25A271399
- A290865(n) -(n-1).at n=24A290876
- Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of normalized 2n-plets, with single or double steps, associated to trees with k edges.at n=31A294440
- Number of 3Xn 0..1 arrays with every element equal to 0, 1, 2 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=10A302416
- Numbers n for which A326073(n) is equal to abs(1+A326146(n)).at n=13A326074
- Lesser of 2 successive squarefree semiprimes (k, k+4) sandwiching 3 consecutive nonsquarefree numbers.at n=34A363821