177
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 240
- Proper Divisor Sum (Aliquot Sum)
- 63
- 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
- 1
- Radical
- 177
- Omega Function (Ω)
- 2
- 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
- 31
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Names
- German
- einshundertsiebenundsiebzig· ordinal: einshundertsiebenundsiebzigste
- English
- one hundred seventy-seven· ordinal: one hundred seventy-seventh
- Spanish
- ciento setenta y siete· ordinal: 177º
- French
- cent soixante-dix-sept· ordinal: cent soixante-dix-septième
- Italian
- centosettantasette· ordinal: 177º
- Latin
- centum septuaginta septem· ordinal: 177.
- Portuguese
- cento e setenta e sete· ordinal: 177º
Appears in sequences
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives A(A000099(n)).at n=8A000323
- Number of graphs with n edges.at n=7A000664
- Boustrophedon transform of 1,1,2,4,8,16,32,...at n=5A000734
- Expansion of e.g.f. exp(x)*(1 + tan(x))/(1 - tan(x)).at n=4A000834
- Euler's "numerus idoneus" (or "numeri idonei", or idoneal, or suitable, or convenient numbers).at n=44A000926
- Number of free nonplanar polyenoids with n nodes and symmetry point group C_{2v}.at n=7A000947
- Numbers k such that sum of squares of k consecutive integers >= 1 is a square.at n=21A001032
- Numbers n such that the sum of the squares of n consecutive positive odd numbers x^2 + (x+2)^2 + ... + (x+2n-2)^2 = k^2 for some integer k. The least values of x and k for each n are in A056131 and A056132, respectively.at n=13A001033
- Semiprimes (or biprimes): products of two primes.at n=56A001358
- Number of n-node rooted trees of height at most 3.at n=10A001383
- Partial sums of A006206.at n=13A001461
- Partial sums of A001462; also a(n) is the last occurrence of n in A001462.at n=28A001463
- Another approximation to A000084(n).at n=6A001573
- a(n) = 2^n + n^2.at n=7A001580
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = a(1) = 1.at n=10A001595
- a(n) = 7^n + n^7.at n=2A001596
- Numbers whose digits contain no loops (version 2).at n=54A001742
- a(n) = 3 * prime(n).at n=16A001748
- Sorting numbers: number of comparisons for merge insertion sort of n elements.at n=42A001768
- Numbers k such that 7*2^k - 1 is prime.at n=7A001771