434
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 768
- Proper Divisor Sum (Aliquot Sum)
- 334
- 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
- 180
- Möbius Function
- -1
- Radical
- 434
- 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
- 27
- 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
- vierhundertvierunddreißig· ordinal: vierhundertvierunddreißigste
- English
- four hundred thirty-four· ordinal: four hundred thirty-fourth
- Spanish
- cuatrocientos treinta y cuatro· ordinal: 434º
- French
- quatre cent trente-quatre· ordinal: quatre cent trente-quatrième
- Italian
- quattrocentotrentaquattro· ordinal: 434º
- Latin
- quadringenti triginta quattuor· ordinal: 434.
- Portuguese
- quatrocentos e trinta e quatro· ordinal: 434º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=55A000008
- a(n) = n*(n+3)/2.at n=28A000096
- EULER transform of 3, 2, 2, 2, 2, 2, 2, 2, ...at n=8A000713
- Numbers that are the sum of 2 successive primes.at n=46A001043
- Numbers that are the sum of 4 cubes in more than 1 way.at n=25A001245
- Palindromes in base 10.at n=52A002113
- Numbers k such that binomial(2*k,k) is divisible by (k+1)^2.at n=37A002503
- Numbers that are the sum of 3 positive cubes.at n=57A003072
- Endpoints (leaves) in rooted trees with n nodes.at n=7A003227
- Numbers that are the sum of 4 nonzero 4th powers.at n=22A003338
- Numbers that are the sum of 9 positive 4th powers.at n=46A003343
- Number of nonequivalent dissections of an n-gon into n-3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=5A003447
- Numbers that are the sum of at most 4 nonzero 4th powers.at n=52A004833
- Starts 0, 4 and contains no 3-term arithmetic progression.at n=53A005487
- a(n) = cost of minimal multiplication-cost addition chain for n.at n=35A005766
- Number of points on surface of hexagonal prism: 12*n^2 + 2 for n > 0 (coordination sequence for W(2)).at n=6A005914
- Number of points on surface of square pyramid: 3*n^2 + 2 (n>0).at n=12A005918
- Numbers k such that k^8 + 1 is prime.at n=16A006314
- Consider a 2-D cellular automaton generated by the Schrandt-Ulam rule of A170896, but confined to a semi-infinite strip of width n, starting with one ON cell at the top left corner; a(n) is the period of the resulting structure.at n=46A006447
- Partitioning integers to avoid arithmetic progressions of length 3.at n=55A006998