1086
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2184
- Proper Divisor Sum (Aliquot Sum)
- 1098
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 360
- Möbius Function
- -1
- Radical
- 1086
- 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
- yes
- 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 polyhexes with n hexagons, having reflectional symmetry (see Harary and Read for precise definition).at n=12A002215
- Number of n-step walks on square lattice.at n=6A002900
- a(n) = floor(tau*a(n-2)) + a(n-1) with a(0)=1 and a(1)=3.at n=11A005907
- 4-dimensional analog of centered polygonal numbers.at n=7A006322
- Number of loopless rooted planar maps with 3 faces and n vertices and no isthmuses. Also a(n)=T(4,n-3), array T as in A049600.at n=15A006416
- Smith (or joke) numbers: composite numbers k such that sum of digits of k = sum of digits of prime factors of k (counted with multiplicity).at n=49A006753
- Number of elements (a b, c d) in GL(2,Z) with |det| = 1, trace <= n and 0 <= a <= {b, c} <= d.at n=49A007295
- Coordination sequence T1 for Zeolite Code NES.at n=21A008205
- a(n) = (5*n^2 + 1)*n^2 / 6.at n=6A008354
- Molien series for A_5.at n=32A008628
- Coordination sequence for CaF2(1), Ca position.at n=11A009923
- Aliquot sequence starting at 1074.at n=1A014364
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14).at n=33A017845
- Powers of cube root of 20 rounded to nearest integer.at n=7A018034
- Powers of cube root of 20 rounded up.at n=7A018035
- (n-2)nd Catalan number is congruent to n/3 mod n.at n=46A019467
- Expansion of 1/((1-x)(1-2x)(1-4x)(1-7x)).at n=3A021079
- a(n) = n*(15*n + 1)/2.at n=12A022273
- Number of 3's in n-th term of A022482.at n=28A022486
- a(n) = a(n-1) + c(n-1) for n >= 2, a( ) increasing, given a(1)=4; where c( ) is complement of a( ).at n=41A022936