1742
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2856
- Proper Divisor Sum (Aliquot Sum)
- 1114
- 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
- 792
- Möbius Function
- -1
- Radical
- 1742
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 179
- 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
- Sum of upward diagonals of Eulerian triangle.at n=9A000800
- 2nd differences are periodic.at n=30A002082
- Record values in A005210.at n=46A005211
- Oscillates under partition transform.at n=38A007213
- Coordination sequence T1 for Zeolite Code CHA.at n=32A008066
- Expansion of (1+x^11)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=50A008772
- Coordination sequence T3 for Zeolite Code RSN.at n=27A009887
- a(1) = 1, a(n) = Sum_{k=1..n-1} ((11^k - 1)/10)*a(k).at n=3A015513
- Expansion of 1/(1 - x^5 - x^6).at n=71A017837
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).at n=15A024590
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=14A025104
- Sequence satisfies T^2(a)=a, where T is defined below.at n=38A027596
- Multiplicity of highest weight (or singular) vectors associated with character chi_163 of Monster module.at n=37A034551
- Numbers whose base-12 representation has the same nonzero number of 0's and 2's.at n=41A039494
- Number of partitions satisfying cn(0,5) = cn(1,5) + cn(4,5).at n=38A039858
- Numerators of continued fraction convergents to sqrt(934).at n=6A042806
- Base-5 palindromes that start with 2.at n=31A043007
- Numbers k such that 2 and 4 occur juxtaposed in the base-10 representation of k but not of k-1.at n=35A043234
- Numbers having three 2's in base 6.at n=22A043379
- Numbers whose base-12 representation has exactly 4 runs.at n=1A043653