174
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 360
- Proper Divisor Sum (Aliquot Sum)
- 186
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 56
- Möbius Function
- -1
- Radical
- 174
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- no
- 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
- yes
- Odd
- no
Names
- German
- einshundertvierundsiebzig· ordinal: einshundertvierundsiebzigste
- English
- one hundred seventy-four· ordinal: one hundred seventy-fourth
- Spanish
- ciento setenta y cuatro· ordinal: 174º
- French
- cent soixante-quatorze· ordinal: cent soixante-quatorzième
- Italian
- centosettantaquattro· ordinal: 174º
- Latin
- centum septuaginta quattuor· ordinal: 174.
- Portuguese
- cento e setenta e quatro· ordinal: 174º
Appears in sequences
- Numbers k such that k^4 + 1 is prime.at n=26A000068
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.at n=12A000092
- Denumerants: Expansion of 1/((1-x)*(1-x^2)*(1-x^5)).at n=55A000115
- Number of bicentered hydrocarbons with n atoms.at n=12A000200
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); A000092 gives values of n where |P(n)| sets a new record; sequence gives (nearest integer to, I believe) P(A000092(n)).at n=15A000223
- 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=14A000232
- A Beatty sequence: [ n(e+1) ].at n=46A000572
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^3)).at n=15A000601
- Semi-meanders: number of ways a semi-infinite directed curve can cross a straight line n times.at n=7A000682
- Number of compositions of n into 3 ordered relatively prime parts.at n=20A000741
- Number of twin prime pairs < square of n-th prime.at n=23A000885
- Numbers that are divisible by at least three different primes.at n=24A000977
- Continued fraction for e^2.at n=70A001204
- Expansion of e.g.f. 6*exp(x)/(1-x)^4.at n=2A001341
- a(n) = Sum_{k=0..2} (n+k)! * C(2,k).at n=4A001344
- Number of self-avoiding n-step walks on honeycomb lattice.at n=7A001668
- Numbers k such that 3^k, 3^(k+1) and 3^(k+2) have the same number of digits.at n=8A001682
- Expansion of 1/((1+x)*(1-x)^10).at n=3A001781
- Number of permutations of {1,...,n} having n-4 inversions (n>=4).at n=4A001894
- A Beatty sequence: a(n) = floor(n*(2 + sqrt(2))).at n=50A001952