274
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
- 4
- Divisor Sum
- 414
- Proper Divisor Sum (Aliquot Sum)
- 140
- 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
- 136
- Möbius Function
- 1
- Radical
- 274
- 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
- yes
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 91
- Smith Number
- yes
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
- yes
- Odd
- no
Names
- German
- zweihundertvierundsiebzig· ordinal: zweihundertvierundsiebzigste
- English
- two hundred seventy-four· ordinal: two hundred seventy-fourth
- Spanish
- doscientos setenta y cuatro· ordinal: 274º
- French
- deux cent soixante-quatorze· ordinal: deux cent soixante-quatorzième
- Italian
- duecentosettantaquattro· ordinal: 274º
- Latin
- ducenti septuaginta quattuor· ordinal: 274.
- Portuguese
- duzentos e setenta e quatro· ordinal: 274º
Appears in sequences
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3 with a(0) = a(1) = 0 and a(2) = 1.at n=12A000073
- Unsigned Stirling numbers of first kind, s(n+1,2): a(n+1) = (n+1)*a(n) + n!.at n=5A000254
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^3)).at n=18A000601
- Maximal number of states in the minimal deterministic finite automaton accepting a language over a binary alphabet consisting of some words of length n.at n=10A000802
- Stirling numbers of first kind s(n+4, n).at n=1A000915
- Differences of reciprocals of unity.at n=1A001242
- Smallest k such that the product of q/(q-1) over the primes from prime(n) to prime(n+k-1) is greater than 2.at n=12A001276
- Winning moves in Fibonacci nim.at n=48A001581
- 2 together with primes multiplied by 2.at n=33A001747
- Numbers k such that 5*2^k - 1 is prime.at n=15A001770
- v-pile counts for the 4-Wythoff game with i=2.at n=52A001966
- Number of polyhexes with n hexagons, having reflectional symmetry (see Harary and Read for precise definition).at n=10A002215
- Smallest number of stones in Tchoukaillon (or Mancala, or Kalahari) solitaire that make use of n-th hole.at n=28A002491
- Numbers k such that (k^2 + k + 1)/3 is prime.at n=39A002640
- The square sieve.at n=27A002960
- Number of simple imperfect squared squares of order n up to symmetry.at n=20A002962
- Beginnings of periodic unitary aliquot sequences.at n=21A003062
- Schur's 1926 partition theorem: number of partitions of n into parts 6n+1 or 6n-1.at n=45A003105
- Szekeres's sequence: a(n)-1 in ternary = n-1 in binary; also: a(1) = 1, a(2) = 2, and thereafter a(n) is smallest number k which avoids any 3-term arithmetic progression in a(1), a(2), ..., a(n-1), k.at n=42A003278
- Numbers that are the sum of 4 nonzero 4th powers.at n=14A003338