336
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 992
- Proper Divisor Sum (Aliquot Sum)
- 656
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- yes
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 96
- Möbius Function
- 0
- Radical
- 42
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 11
- Smith Number
- 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
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- dreihundertsechsunddreißig· ordinal: dreihundertsechsunddreißigste
- English
- three hundred thirty-six· ordinal: three hundred thirty-sixth
- Spanish
- trescientos treinta y seis· ordinal: 336º
- French
- trois cent trente-six· ordinal: trois cent trente-sixième
- Italian
- trecentotrentasei· ordinal: 336º
- Latin
- trecenti triginta sex· ordinal: 336.
- Portuguese
- trezentos e trinta e seis· ordinal: 336º
Appears in sequences
- Order of the group SL(2,Z_n).at n=6A000056
- a(n) = n^2*Product_{p|n} (1 + 1/p).at n=13A000082
- Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.at n=26A000118
- Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.at n=52A000118
- Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.at n=41A000118
- Number of discordant permutations.at n=3A000561
- Number of partitions of n into prime parts.at n=41A000607
- Moser-de Bruijn sequence: sums of distinct powers of 4.at n=28A000695
- a(n) is the solution to the postage stamp problem with n denominations and 5 stamps.at n=6A001215
- Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.at n=38A001263
- Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.at n=42A001263
- Triangle in which k-th number (0<=k<=n) in n-th row (0<=n) is number of dodecads in Golay code G_24 containing k given points and missing n-k given points.at n=7A001294
- Triangle in which k-th number (0<=k<=n) in n-th row (0<=n) is number of dodecads in Golay code G_24 containing k given points and missing n-k given points.at n=8A001294
- a(0) = 1, a(1) = 6, a(2) = 24; for n>=3, a(n) = 4a(n-1) - a(n-2).at n=4A001352
- a(n) = (5*n + 1)*(5*n + 2)*(5*n + 3).at n=1A001509
- Number of self-avoiding n-step walks on honeycomb lattice.at n=8A001668
- a(n) = n!/5!.at n=3A001725
- a(n) = (2*n)!/(n+1)!.at n=4A001761
- Number of rooted planar cubic maps with 2n vertices.at n=3A002005
- Highly abundant numbers: numbers k such that sigma(k) > sigma(m) for all m < k.at n=31A002093