374
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 648
- Proper Divisor Sum (Aliquot Sum)
- 274
- 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
- 160
- Möbius Function
- -1
- Radical
- 374
- 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
- 45
- 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
- dreihundertvierundsiebzig· ordinal: dreihundertvierundsiebzigste
- English
- three hundred seventy-four· ordinal: three hundred seventy-fourth
- Spanish
- trescientos setenta y cuatro· ordinal: 374º
- French
- trois cent soixante-quatorze· ordinal: trois cent soixante-quatorzième
- Italian
- trecentosettantaquattro· ordinal: 374º
- Latin
- trecenti septuaginta quattuor· ordinal: 374.
- Portuguese
- trezentos e setenta e quatro· ordinal: 374º
Appears in sequences
- Numbers k such that k^4 + 1 is prime.at n=51A000068
- 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=18A000092
- a(n) = floor(n^(3/2)).at n=52A000093
- Number of nontrivial Baxter permutations of length 2n-1.at n=5A001183
- From rook polynomials.at n=5A001925
- Numbers dividing A002037(i) and larger than A002037(i-1), for some i>0.at n=32A002038
- Numbers k such that 25*4^k + 1 is prime.at n=17A002263
- a(n) = Sum_{d|n, d <= 3} d^2 + 3*Sum_{d|n, d>3} d.at n=67A002660
- a(n) = Sum_{d|n, d <= 4} d^2 + 4*Sum_{d|n, d>4} d.at n=41A002791
- a(0) = 1; for n > 0, a(n) = a(n-1) + floor(sqrt(a(n-1))).at n=41A002984
- Beginnings of periodic unitary aliquot sequences.at n=29A003062
- Number of partitions of n into parts 5k+1 or 5k+4.at n=40A003114
- Numbers that are the sum of 9 positive 4th powers.at n=39A003343
- Numbers that are the sum of 8 positive 5th powers.at n=13A003353
- Sum of remainders of n mod k, for k = 1, 2, 3, ..., n.at n=47A004125
- a(n) = 100*log(n) rounded to nearest integer.at n=41A004238
- a(n) = ceiling(100*log(n)).at n=41A004239
- a(n) = least integer m > a(n-1) such that m - a(n-1) != a(j) - a(k) for all j, k less than n; a(1) = 1, a(2) = 2.at n=19A004978
- Numbers k such that k and k+1 have the same number of divisors.at n=51A005237
- Numbers k such that k, k+1 and k+2 have the same number of divisors.at n=11A005238