1106
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1920
- Proper Divisor Sum (Aliquot Sum)
- 814
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 468
- Möbius Function
- -1
- Radical
- 1106
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 137
- 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
- Number of ways to pair up {1..2n} so sum of each pair is prime.at n=7A000341
- Number of permutations of an n-sequence discordant with three given permutations (see reference) in n-2 places.at n=3A000388
- Number of inequivalent Hadamard designs of order 4n.at n=5A001111
- Expansion of 1/((1+x)*(1-x)^7).at n=7A001769
- a(n) = least value of m for which Liouville's function A002819(m) = -n.at n=36A002053
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals up to rotation and reflection.at n=26A003453
- a(n) = floor(n*phi^10), where phi is the golden ratio, A001622.at n=9A004925
- Truncated tetrahedral numbers: a(n) = (1/6)*(n+1)*(23*n^2 + 19*n + 6).at n=6A005906
- Numbers k such that k^8 + 1 is prime.at n=44A006314
- Coordination sequence T2 for Zeolite Code AET.at n=23A008008
- Coordination sequence T3 for Zeolite Code LIO.at n=23A008131
- Coordination sequence T3 for Zeolite Code MTW.at n=22A008198
- Expansion of 1/( Product_{j=0..5} (1-x^(2*j+1)) ).at n=50A008675
- Coordination sequence T3 for Zeolite Code -CHI.at n=21A009848
- Coordination sequence T3 for Zeolite Code -ROG.at n=25A009861
- Coordination sequence T2 for Zeolite Code AFX.at n=25A009865
- Numbers k such that phi(k) + 12 | sigma(k).at n=34A015805
- Expansion of 1/(1-x^4-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13).at n=28A017835
- Coordination sequence T3 for Zeolite Code SAO.at n=26A019573
- Least k such that b(k) = n, where b( ) is sequence A020944.at n=49A020948