430
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 792
- Proper Divisor Sum (Aliquot Sum)
- 362
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- yes
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 168
- Möbius Function
- -1
- Radical
- 430
- 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
- 102
- 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
- vierhundertdreißig· ordinal: vierhundertdreißigste
- English
- four hundred thirty· ordinal: four hundred thirtieth
- Spanish
- cuatrocientos treinta· ordinal: 430º
- French
- quatre cent trente· ordinal: quatre cent trentième
- Italian
- quattrocentotrenta· ordinal: 430º
- Latin
- quadringenti triginta· ordinal: 430.
- Portuguese
- quatrocentos e trinta· ordinal: 430º
Appears in sequences
- Numbers k such that k^4 + 1 is prime.at n=53A000068
- a(n) = floor(n^(3/2)).at n=57A000093
- Number of alkyls S C_{n+4} H_{2n+4} with n carbon atoms.at n=7A000650
- Numbers beginning with letter 'f' in English.at n=54A000867
- Related to Zarankiewicz's problem.at n=27A001841
- Total diameter of labeled trees with n nodes.at n=4A001852
- a(n) = Sum_{k=0..n} f(k)*f(n-k) where f(k) = A002124(k).at n=23A002125
- Take solution to Pellian equation x^2 - n*y^2 = 1 with smallest positive y and x >= 0; sequence gives a(n) = y, or 0 if n is a square. A002350 gives values of x.at n=73A002349
- The square sieve.at n=35A002960
- G.f.: (1 + x^3 + x^4 + ... + x^12 + x^15)/Product_{i=1..10} (1 - x^i).at n=15A003403
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals up to rotation and reflection.at n=18A003453
- a(n) = floor(Fibonacci(n)/6).at n=18A004699
- Numbers k such that 2*(2k-3)!/(k!*(k-1)!) is an integer.at n=43A004782
- Numbers k such that 3!*(2k-4)!/(k!*(k-1)!) is an integer.at n=53A004783
- a(n) = floor(n*phi^6), phi = golden ratio, A001622.at n=24A004921
- Untouchable numbers, also called nonaliquot numbers: impossible values for the sum of aliquot parts function (A001065).at n=33A005114
- Sequence and first differences (A030124) together list all positive numbers exactly once.at n=25A005228
- Numbers n such that n^32 + 1 is prime.at n=13A006315
- Sphenic numbers: products of 3 distinct primes.at n=49A007304
- An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=20A007333