337
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 338
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 336
- Möbius Function
- -1
- Radical
- 337
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 112
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 68
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- dreihundertsiebenunddreißig· ordinal: dreihundertsiebenunddreißigste
- English
- three hundred thirty-seven· ordinal: three hundred thirty-seventh
- Spanish
- trescientos treinta y siete· ordinal: 337º
- French
- trois cent trente-sept· ordinal: trois cent trente-septième
- Italian
- trecentotrentasette· ordinal: 337º
- Latin
- trecenti triginta septem· ordinal: 337.
- Portuguese
- trezentos e trinta e sete· ordinal: 337º
Appears in sequences
- Number of positive integers <= 2^n of form x^2 + y^2.at n=10A000050
- Moser-de Bruijn sequence: sums of distinct powers of 4.at n=29A000695
- Primes p of the form 3k+1 such that Sum_{x=1..p} cos(2*Pi*x^3/p) > sqrt(p).at n=16A000921
- Numbers k such that sum of squares of k consecutive integers >= 1 is a square.at n=37A001032
- Numbers n such that the sum of the squares of n consecutive positive odd numbers x^2 + (x+2)^2 + ... + (x+2n-2)^2 = k^2 for some integer k. The least values of x and k for each n are in A056131 and A056132, respectively.at n=25A001033
- Primes == +-1 (mod 8).at n=30A001132
- Table T(n,k) in which n-th row lists prime factors of 2^n - 1 (n >= 2), with repetition.at n=52A001265
- Smallest prime p such that the product of q/(q-1) over the primes from prime(n) to p is greater than 2.at n=6A001275
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)*(1-x^10)*(1-x^20)).at n=21A001305
- Number of ways of making change for n cents using coins of 1, 2, 4, 10, 20, 40, 100 cents.at n=42A001310
- Number of ways of making change for n cents using coins of 1, 2, 4, 10, 20, 40, 100 cents.at n=43A001310
- The coding-theoretic function A(n,4,3).at n=45A001839
- a(1)=2, a(2)=3; for n >= 3, a(n) is smallest number that is uniquely of the form a(j) + a(k) with 1 <= j < k < n.at n=58A001857
- Full reptend primes: primes with primitive root 10.at n=24A001913
- Pythagorean primes: primes of the form 4*k + 1.at n=31A002144
- Numbers k for which the rank of the elliptic curve y^2 = x^3 + k is 2.at n=49A002155
- a(n) = least primitive factor of 2^(2n+1) - 1.at n=10A002184
- Primes congruent to 1 or 2 modulo 4; or, primes of form x^2 + y^2; or, -1 is a square mod p.at n=32A002313
- Let p = A007645(n) be the n-th generalized cuban prime and write p^2 = x^2 + 3*y^2 with y > 0; a(n) = x.at n=54A002367
- Primes of the form 6m + 1.at n=31A002476