37
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 38
- 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
- 36
- Möbius Function
- -1
- Radical
- 37
- 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
- 21
- Smith Number
- no
Classification
- Natural
- yes
- Even
- no
- Odd
- yes
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
- 12
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Names
- German
- siebenunddreißig· ordinal: siebenunddreißigste
- English
- thirty-seven· ordinal: thirty-seventh
- Spanish
- treinta y siete· ordinal: 37º
- French
- trente-sept· ordinal: trente-septième
- Italian
- trentasette· ordinal: 37º
- Latin
- triginta septem· ordinal: 37.
- Portuguese
- trinta e sete· ordinal: 37º
Appears in sequences
- Smallest prime power >= n.at n=32A000015
- Smallest prime power >= n.at n=33A000015
- Smallest prime power >= n.at n=34A000015
- Smallest prime power >= n.at n=35A000015
- Smallest prime power >= n.at n=36A000015
- Number of centered hydrocarbons with n atoms.at n=10A000022
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=36A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=36A000027
- Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.at n=17A000028
- Numbers that are not squares (or, the nonsquares).at n=30A000037
- Numbers k such that (2k)^4 + 1 is prime.at n=12A000059
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=26A000062
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=18A000069
- Number of unrooted nonseparable planar maps with n edges and a distinguished face.at n=5A000087
- Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.at n=8A000124
- Positive zeros of Bessel function of order 0 rounded to nearest integer.at n=11A000134
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=22A000201
- a(8i+j) = 13i + a(j), where 1<=j<=8.at n=22A000202
- A Beatty sequence: floor(n*(e-1)).at n=21A000210
- Take sum of squares of digits of previous term, starting with 2.at n=3A000216