236
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 420
- Proper Divisor Sum (Aliquot Sum)
- 184
- 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
- 116
- Möbius Function
- 0
- Radical
- 118
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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
- zweihundertsechsunddreißig· ordinal: zweihundertsechsunddreißigste
- English
- two hundred thirty-six· ordinal: two hundred thirty-sixth
- Spanish
- doscientos treinta y seis· ordinal: 236º
- French
- deux cent trente-six· ordinal: deux cent trente-sixième
- Italian
- duecentotrentasei· ordinal: 236º
- Latin
- ducenti triginta sex· ordinal: 236.
- Portuguese
- duzentos e trinta e seis· ordinal: 236º
Appears in sequences
- Numbers k such that (2k)^4 + 1 is prime.at n=56A000059
- Schroeder's fourth problem; also series-reduced rooted trees with n labeled leaves; also number of total partitions of n.at n=5A000311
- Expansion of Product_{k>=0} (1 + x^(2k+1)); number of partitions of n into distinct odd parts; number of self-conjugate partitions; number of symmetric Ferrers graphs with n nodes.at n=62A000700
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 20, 50 cents.at n=40A001313
- Number of connected graphs with n nodes and n+1 edges.at n=7A001435
- Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5), a(0)=a(1)=a(2)=a(3)=0, a(4)=1.at n=13A001591
- Primes multiplied by 4.at n=16A001749
- Number of permutations of [n] with n-3 sequences.at n=2A001759
- Normalized total height of rooted trees with n nodes.at n=4A001863
- Number of permutations p of {1,2,...,n} such that p(i) - i < 0 or p(i) - i > 2 for all i.at n=7A001887
- Beatty sequence of (5+sqrt(13))/2.at n=54A001956
- v-pile positions of the 4-Wythoff game with i=1.at n=45A001964
- Numbers congruent to {2, 4, 8, 16} (mod 20).at n=47A002081
- Numbers k for which the rank of the elliptic curve y^2 = x^3 - k is 2.at n=31A002154
- Number of solutions to a linear inequality.at n=14A002797
- Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) = least number > a(n-1) which is a unique sum of two distinct earlier terms.at n=45A002858
- a(1) = 1, 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=54A002859
- Numbers k such that 2*10^k - 1 is prime.at n=9A002957
- Numbers k such that 4*k^2 + 9 is prime.at n=44A002970
- For n > 4, a(n) is the least integer > a(n-1) with precisely two representations a(n) = a(i) + a(j), 1 <= i < j < n; and a(n) = n for n=1..4.at n=47A003044