2768
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 5394
- Proper Divisor Sum (Aliquot Sum)
- 2626
- 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
- 1376
- Möbius Function
- 0
- Radical
- 346
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- 35
- 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
- Construct a triangle as in A036262. Sequence is one less than the position of the first number larger than 2 in the n-th row (n-th difference).at n=41A000232
- a(n) = floor(tau*a(n-1)) + a(n-2) with a(0)=0 and a(1)=1.at n=13A005821
- Expansion of (1+x^10)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=58A008771
- G.f.: (1+x)*(1+x^3)*(1+x^5)*(1+x^7)*(1+x^9)/((1-x^2)*(1-x^4)*(1-x^6)*(1-x^8)*(1-x^10)).at n=50A014670
- Expansion of Product_{m>=1} (1+x^m)^4.at n=11A022569
- 7-automorphic numbers ending in 8: final digits of 7n^2 agree with n.at n=3A030992
- Coordination sequence T2 for Zeolite Code CFI.at n=35A033600
- Position of first term > 2 in n-th row of Gilbreath array shown in A036262.at n=43A036277
- Coordination sequence T6 for Zeolite Code ESV.at n=35A038413
- Coordination sequence T4 for Zeolite Code STT.at n=35A038417
- Coordination sequence T3 for Zeolite Code STF.at n=35A038442
- Triangle of D-analogs of Stirling numbers of the 2nd kind.at n=37A039760
- Triangle of D-analogs of Stirling numbers of the 2nd kind.at n=43A039761
- Numbers whose base-14 representation has exactly 4 runs.at n=9A043665
- Numbers n such that string 1,5 occurs in the base 9 representation of n but not of n-1.at n=38A044265
- Numbers n such that string 6,8 occurs in the base 10 representation of n but not of n-1.at n=30A044400
- Numbers k such that string 1,5 occurs in the base 9 representation of k but not of k+1.at n=38A044646
- Numbers n such that string 6,8 occurs in the base 10 representation of n but not of n+1.at n=30A044781
- Number of Greek-key tours on a 3 X n board; i.e., self-avoiding walks on a 3 X n grid starting in the top left corner.at n=10A046994
- Row 3 of array in A047666.at n=15A047667