176
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 372
- Proper Divisor Sum (Aliquot Sum)
- 196
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 80
- Möbius Function
- 0
- Radical
- 22
- Omega Function (Ω)
- 5
- 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
- yes
- 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
- 18
- 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
- einshundertsechsundsiebzig· ordinal: einshundertsechsundsiebzigste
- English
- one hundred seventy-six· ordinal: one hundred seventy-sixth
- Spanish
- ciento setenta y seis· ordinal: 176º
- French
- cent soixante-seize· ordinal: cent soixante-seizième
- Italian
- centosettantasei· ordinal: 176º
- Latin
- centum septuaginta sex· ordinal: 176.
- Portuguese
- cento e setenta e seis· ordinal: 176º
Appears in sequences
- Number of primitive polynomials of degree n over GF(2) (version 2).at n=10A000020
- a(n) is the number of partitions of n (the partition numbers).at n=15A000041
- Numbers k such that (2k)^4 + 1 is prime.at n=48A000059
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=10A000125
- a(n) = floor(n^2/3).at n=23A000212
- Construct a triangle as in A036262. Sequence is one less than the position of the first number larger than 2 in the n-th row (n-th difference).at n=16A000232
- Construct a triangle as in A036262. Sequence is one less than the position of the first number larger than 2 in the n-th row (n-th difference).at n=15A000232
- Construct a triangle as in A036262. Sequence is one less than the position of the first number larger than 2 in the n-th row (n-th difference).at n=18A000232
- Construct a triangle as in A036262. Sequence is one less than the position of the first number larger than 2 in the n-th row (n-th difference).at n=17A000232
- Number of rooted planar bridgeless cubic maps with 2n nodes.at n=4A000309
- Pentagonal numbers: a(n) = n*(3*n-1)/2.at n=11A000326
- Number of permutations of an n-sequence discordant with three given permutations (see reference) in n-3 places.at n=3A000380
- Octagonal numbers: n*(3*n-2). Also called star numbers.at n=8A000567
- Number of monosubstituted alkanes C(n-1)H(2n-1)-X with n-1 carbon atoms that are stereoisomers.at n=8A000620
- Number of n-step self-avoiding walks on cubic lattice ending at point with x=1.at n=3A000760
- Total number of 1's in binary expansions of 0, ..., n.at n=60A000788
- Number of n-input 3-output switching networks under action of complementing group on the inputs and outputs.at n=1A000839
- Expansion of g.f. (1 + x + 2*x^2)/((1 - x)^2*(1 - x^3)).at n=15A000969
- Generalized octagonal numbers: k*(3*k-2), k=0, +- 1, +- 2, +-3, ...at n=15A001082
- Image of n under the map n->n/2 if n even, n->3n-1 if n odd.at n=59A001281