4116
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 11200
- Proper Divisor Sum (Aliquot Sum)
- 7084
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1176
- Möbius Function
- 0
- Radical
- 42
- Omega Function (Ω)
- 6
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 126
- 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
- Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n.at n=16A000031
- a(n) = Sum_{k=1..n-1} k*sigma(k)*sigma(n-k).at n=11A000441
- Number of paraffins.at n=11A006009
- Number of n-step spirals on hexagonal lattice.at n=16A006777
- Number of cycles induced by iterating the Gray-coding of an n-bit number: a(n+1) = a(n) + 2^n/C_n, where C_n = least power of 2 >= n (C_n is the length of the cycle), with a(0) = 1.at n=16A007886
- Coordination sequence T3 for Zeolite Code BRE.at n=42A008060
- Coordination sequence T3 for Zeolite Code HEU.at n=42A008118
- Coordination sequence T6 for Zeolite Code MFI.at n=41A008169
- Expansion of (1-x^6) / (1-x)^6.at n=11A008488
- Triangle of coefficients in expansion of (3+7x)^n.at n=13A013624
- a(n) = (2*n - 7)*n^2.at n=14A015242
- Numbers k such that k | (phi(k) * sigma(k)) but (phi(k) + sigma(k))/k does not increase.at n=34A015708
- Numbers k such that phi(k) | sigma_14(k).at n=17A015773
- Multiply by 1, add 1, multiply by 2, add 2, etc.; start with 3.at n=12A019466
- Even numbers k such that in k^2 the parity of digits alternates.at n=40A030157
- Numbers whose base-4 representation has 4 more 0's than 3's.at n=31A031465
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 42.at n=22A031540
- Number of n-node rooted trees with nodes of 2 colors.at n=6A038055
- Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*3^j.at n=11A038269
- Sums of 3 distinct powers of 4.at n=22A038471