436
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 770
- Proper Divisor Sum (Aliquot Sum)
- 334
- 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
- 216
- Möbius Function
- 0
- Radical
- 218
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 115
- 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
- vierhundertsechsunddreißig· ordinal: vierhundertsechsunddreißigste
- English
- four hundred thirty-six· ordinal: four hundred thirty-sixth
- Spanish
- cuatrocientos treinta y seis· ordinal: 436º
- French
- quatre cent trente-six· ordinal: quatre cent trente-sixième
- Italian
- quattrocentotrentasei· ordinal: 436º
- Latin
- quadringenti triginta sex· ordinal: 436.
- Portuguese
- quatrocentos e trinta e seis· ordinal: 436º
Appears in sequences
- Partial sums of (unordered) ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=23A000064
- Numbers k such that k^4 + 1 is prime.at n=54A000068
- 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=29A000124
- Related to S(n), the number of self-dual monotone Boolean functions of n variables (A001206): 2^n-th term is S(n).at n=23A001087
- Partial sums of A001462; also a(n) is the last occurrence of n in A001462.at n=50A001463
- Numbers k such that 3^k, 3^(k+1) and 3^(k+2) have the same number of digits.at n=20A001682
- Primes multiplied by 4.at n=28A001749
- Number of self-converse relations on n points.at n=4A002500
- Expansion of a modular function for Gamma_0(15).at n=10A002510
- Number of different ways one can attack all squares on an n X n chessboard with the smallest number of non-attacking queens needed.at n=13A002568
- Max_{k=0..n} { Number of partitions of n into exactly k parts }.at n=28A002569
- Beginnings of periodic unitary aliquot sequences.at n=36A003062
- Schur's 1926 partition theorem: number of partitions of n into parts 6n+1 or 6n-1.at n=50A003105
- a(n) = ceiling(24(2^n-1)/n).at n=6A003177
- Numbers that are the sum of 6 positive 4th powers.at n=33A003340
- Numbers that are the sum of 11 positive 4th powers.at n=54A003345
- Numbers that are the sum of 8 positive 5th powers.at n=15A003353
- a(n) = 5*a(n-1) - a(n-2), with a(1)=1, a(2)=4.at n=4A004253
- Primes written in base 7.at n=47A004681
- Numbers k such that 2*(2k-3)!/(k!*(k-1)!) is an integer.at n=44A004782