11618
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
- 18012
- Proper Divisor Sum (Aliquot Sum)
- 6394
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5616
- Möbius Function
- -1
- Radical
- 11618
- 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
- 50
- 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
- yes
- Odd
- no
Appears in sequences
- Related to representation as sums of squares.at n=22A002292
- a(n) = 6*n^2 + 2 for n > 0, a(0)=1.at n=44A005897
- a(0) = 1, a(n) = 24*n^2 + 2 for n>0.at n=22A010014
- a(n) = n*(17*n - 1)/2.at n=37A022274
- a(n) = C(n+3,4) + 3*C(n+1,3) + 5*C(n-1,2) + 7*n - 15.at n=17A034858
- a(n) = C(n+3,4) + 3*C(n+1,3) + 5*C(n-1,2) + 7*n - 15 for n >= 3; a(1)=1, a(2)=10.at n=18A034859
- Gaps of 9 in sequence A038593 (lower terms).at n=8A038657
- Numbers ending with '8' that are the difference of two positive cubes.at n=39A038863
- Number of rooted trees with n nodes with every leaf at height 5.at n=19A048810
- The number phi_2(n) of Frobenius partitions that allow up to 2 repetitions of an integer in a row.at n=25A053993
- a(n) equals floor(Vc(n) - Vs(n)), where Vc(n) is the volume of the cube with side length n and Vs(n) is the volume of the sphere of diameter n.at n=28A057671
- Row sums of triangle A092422, which is generated from the even-numbered Fibonacci polynomials (A011973).at n=11A092423
- Number of partitions p of n such that 2*(number of even numbers in p) >= (number of odd numbers in p).at n=35A241654
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 825", based on the 5-celled von Neumann neighborhood.at n=21A273581
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n)^2, where a(0) = 2, a(1) = 4, b(0) = 1, b(1) = 3, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=12A296249
- Expansion of Product_{k=1..10} theta_3(q^k), where theta_3() is the Jacobi theta function.at n=36A320242
- Diagonal of the triangle A354490.at n=58A354491
- G.f.: Sum_{k>=0} 2^k * x^(k*(k+1)) / Product_{j=1..k} (1 - x^j).at n=49A376947
- G.f. A(x) satisfies A(x) = 1/((1 - x*A(x)^2) * (1 - x*A(x))^2).at n=5A379185
- a(n) = ((p-1)^n + (p+1)^n) mod p^2, where p is the n-th prime.at n=36A379544