136
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 270
- Proper Divisor Sum (Aliquot Sum)
- 134
- 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
- 64
- Möbius Function
- 0
- Radical
- 34
- 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
- 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
- 15
- 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
- einshundertsechsunddreißig· ordinal: einshundertsechsunddreißigste
- English
- one hundred thirty-six· ordinal: one hundred thirty-sixth
- Spanish
- ciento treinta y seis· ordinal: 136º
- French
- cent trente-six· ordinal: cent trente-sixième
- Italian
- centotrentasei· ordinal: 136º
- Latin
- centum triginta sex· ordinal: 136.
- Portuguese
- cento e trinta e seis· ordinal: 136º
Appears in sequences
- Erroneous version of A032522.at n=12A000017
- 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=65A000028
- Numbers k such that (2k)^4 + 1 is prime.at n=38A000059
- Series-parallel numbers.at n=3A000163
- Partitions into non-integral powers (see Comments for precise definition).at n=6A000234
- 3*n - 2*floor(sqrt(4*n+5)) + 5.at n=53A000277
- Numbers that are the sum of 2 nonzero squares.at n=46A000404
- Numbers that are the sum of 2 but no fewer nonzero squares.at n=44A000415
- Number of n-node rooted trees of height 7.at n=10A000418
- Number of nonnegative solutions to x^2 + y^2 + z^2 <= n.at n=32A000606
- Number of n-node unrooted steric quartic trees; number of n-carbon alkanes C(n)H(2n+2) taking stereoisomers into account.at n=10A000628
- Number of alkyl benzenes with n carbon atoms: C(n)H(2n-6).at n=11A000639
- Boustrophedon transform of 1,1,2,3,4,5,...at n=5A000660
- Number of relations with 3 arguments on n nodes.at n=1A000662
- Total number of 1's in binary expansions of 0, ..., n.at n=50A000788
- Dimensions (sorted, with duplicates removed) of real simple Lie algebras.at n=37A001066
- A continued fraction.at n=6A001112
- Pisano periods (or Pisano numbers): period of Fibonacci numbers mod n.at n=66A001175
- a(n) = floor(n*log((14/11)*n^(10/9))).at n=32A001195
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 20, 50 cents.at n=33A001313