36
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 9
- Divisor Sum
- 91
- Proper Divisor Sum (Aliquot Sum)
- 55
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12
- Möbius Function
- 0
- Radical
- 6
- Omega Function (Ω)
- 4
- 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
- yes
- Perfect Square
- yes
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 21
- Smith Number
- no
Classification
- Natural
- yes
- Even
- yes
- Odd
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- yes
- Carmichael Number
- no
Names
- German
- sechsunddreißig· ordinal: sechsunddreißigste
- English
- thirty-six· ordinal: thirty-sixth
- Spanish
- treinta y seis· ordinal: 36º
- French
- trente-six· ordinal: trente-sixième
- Italian
- trentasei· ordinal: 36º
- Latin
- triginta sex· ordinal: 36.
- Portuguese
- trinta e seis· ordinal: 36º
Appears in sequences
- Euler totient function phi(n): count numbers <= n and prime to n.at n=36A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=56A000010
- Euler totient function phi(n): count numbers <= n and prime to n.at n=62A000010
- Number of positive integers <= 2^n of form x^2 + 10 y^2.at n=7A000024
- Coefficients of the 3rd-order mock theta function f(q).at n=21A000025
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=71A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=35A000027
- Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n.at n=8A000031
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives closest integer to P(A000099(n)).at n=28A000036
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=25A000062
- a(n) = floor(n^(3/2)).at n=11A000093
- Number of transformation groups of order n.at n=21A000113
- Number of transformation groups of order n.at n=39A000113
- Number of transformation groups of order n.at n=43A000113
- Number of transformation groups of order n.at n=53A000113
- Number of cusps of principal congruence subgroup Gamma^{hat}(n).at n=7A000114
- Number of cusps of principal congruence subgroup Gamma^{hat}(n).at n=8A000114
- Denumerants: Expansion of 1/((1-x)*(1-x^2)*(1-x^5)).at n=23A000115
- Number of binary partitions: number of partitions of 2n into powers of 2.at n=8A000123
- Number of self-complementary graphs with n nodes.at n=8A000171