1037
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1116
- Proper Divisor Sum (Aliquot Sum)
- 79
- 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
- 960
- Möbius Function
- 1
- Radical
- 1037
- Omega Function (Ω)
- 2
- 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
- 124
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of compositions of n into a sum of odd primes.at n=33A002124
- Number of triangular cacti with 2n+1 nodes (n triangles).at n=10A003081
- Numbers that are the sum of 7 positive 5th powers.at n=29A003352
- Expansion of g.f.: (1+x^3)*(1+x^4)/((1-x)*(1-x^2)^2*(1-x^4)).at n=28A004657
- Generalized Fibonacci numbers.at n=6A006604
- Number of cases considered in a particular algorithm for enumerating hexaflexagrams.at n=8A007499
- Primitive modest numbers.at n=42A007627
- Coordination sequence T3 for Zeolite Code EUO.at n=20A008098
- Composite but smallest prime factor >= 17.at n=29A008367
- Numbers k such that the continued fraction for sqrt(k) has period 9.at n=11A010339
- Pisot sequence E(3,13): a(n) = floor(a(n-1)^2/a(n-2) + 1/2).at n=4A010903
- Pisot sequence T(3,13), a(n) = floor( a(n-1)^2/a(n-2) ).at n=4A010920
- a(n) = floor( n*(n-1)*(n-2)/26 ).at n=31A011908
- Number of triples of different integers from [ 2,n ] with no common factors between pairs.at n=28A015620
- Pseudoprimes to base 50.at n=17A020178
- Pseudoprimes to base 72.at n=8A020200
- Strong pseudoprimes to base 72.at n=4A020298
- Fibonacci sequence beginning 3, 17.at n=10A022127
- a(n) = n-2 + Sum_{i = 1..n-2} (a(i+1) mod a(i)) for n >= 3 with a(1) = a(2) = 1.at n=48A022856
- The sequence m(n) in A022905.at n=24A022907