537
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 720
- Proper Divisor Sum (Aliquot Sum)
- 183
- 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
- 356
- Möbius Function
- 1
- Radical
- 537
- 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
- 22
- Smith 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
Names
- German
- fünfhundertsiebenunddreißig· ordinal: fünfhundertsiebenunddreißigste
- English
- five hundred thirty-seven· ordinal: five hundred thirty-seventh
- Spanish
- quinientos treinta y siete· ordinal: 537º
- French
- cinq cent trente-sept· ordinal: cinq cent trente-septième
- Italian
- cinquecentotrentasette· ordinal: 537º
- Latin
- quingenti triginta septem· ordinal: 537.
- Portuguese
- quinhentos e trinta e sete· ordinal: 537º
Appears in sequences
- 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=36A001033
- a(n) = 3 * prime(n).at n=40A001748
- a(n) = n^3 + 3*n + 1.at n=8A005491
- Positions of remoteness 5 in Beans-Don't-Talk.at n=24A005697
- Number of irreducible positions of size n in Montreal solitaire.at n=6A007046
- Number of blobs with 2n+1 edges.at n=6A007166
- Number of partitions of n into distinct and pairwise relatively prime parts.at n=61A007360
- Coordination sequence T2 for Zeolite Code MOR.at n=15A008183
- Coordination sequence T3 for Zeolite Code NES.at n=15A008207
- Coordination sequence T8 for Zeolite Code PAU.at n=17A008226
- Crystal ball sequence for planar net 3.6.3.6.at n=15A008580
- Number of distinct orders of permutations of n objects; number of nonisomorphic cyclic subgroups of symmetric group S_n.at n=41A009490
- Numbers k such that C(k,3) = C(x,3) + C(y,3) is solvable.at n=18A010330
- a(n) = floor( n*(n-1)*(n-2)/29 ).at n=26A011911
- Numbers k such that phi(k + 12) | sigma(k).at n=44A015832
- Numbers k such that 2^k == 8 (mod k).at n=49A015922
- Blum integers: numbers of the form p * q where p and q are distinct primes congruent to 3 (mod 4).at n=35A016105
- a(n) = 10*n + 7.at n=53A017353
- a(n) = 11*n + 9.at n=48A017497
- a(n) = 12*n + 9.at n=44A017629