2862
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 6480
- Proper Divisor Sum (Aliquot Sum)
- 3618
- 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
- 936
- Möbius Function
- 0
- Radical
- 318
- Omega Function (Ω)
- 5
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 27
- 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 equivalence classes of 3-valued Post functions of n variables under action of semi-direct product of symmetric group S_n and complementing group D(n,3).at n=1A001325
- Number of equivalence classes of n-valued Post functions of 2 variables under action of semi-direct product of symmetric group S_2 and complementing group D(2,n).at n=1A001326
- a(n) = 2*n*(2*n-1).at n=27A002939
- Number of loopless rooted planar maps with 4 faces and n vertices and no isthmuses.at n=5A006417
- Coordination sequence T2 for Zeolite Code APC.at n=37A008033
- Coordination sequence T2 for Zeolite Code BOG.at n=38A008050
- Coordination sequence T2 for Zeolite Code BPH.at n=41A008056
- Coordination sequence T7 for Zeolite Code DDR.at n=34A008077
- Coordination sequence T3 for Zeolite Code EPI.at n=34A008092
- Coordination sequence T2 for Zeolite Code FER.at n=33A008107
- Coordination sequence for FeS2-Pyrite, Fe position.at n=26A009957
- Coordination sequence T3 for Zeolite Code OSI.at n=35A016432
- Expansion of 1/(1-x^6-x^7-x^8-x^9).at n=53A017849
- From George Gilbert's marks problem: jumping 7 marks at a time (final positions).at n=10A019998
- Nearest integer to Gamma(n + 2/7)/Gamma(2/7).at n=8A020033
- a(n) = floor( Gamma(n+2/7)/Gamma(2/7) ).at n=8A020078
- a(n) = (-1 + prime(n+1)^2)/4.at n=26A024701
- a(n) = floor(Sum_{1<=i<j<=n} (sqrt(j)-sqrt(i))^2).at n=36A025196
- Sum{T(k,k-1)}, k = 1,2,...,n, where T is the array in A026148.at n=8A026163
- Irregular triangular array T read by rows: T(0,0) = 1, T(0,1) = T(0,2) = 0; T(1,0) = T(1,1) = T(1,2) = 1, T(1,3) = 0; for n >= 2, T(n,0) = 1, T(n,1) = T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-2) + T(n-1,k-1) + T(n-1,k) for k = 2,3,...,n+1 and T(n,n+2) = T(n-1,n) + T(n-1,n+1).at n=71A026323