530
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 972
- Proper Divisor Sum (Aliquot Sum)
- 442
- 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
- 208
- Möbius Function
- -1
- Radical
- 530
- 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
- 123
- 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
- fünfhundertdreißig· ordinal: fünfhundertdreißigste
- English
- five hundred thirty· ordinal: five hundred thirtieth
- Spanish
- quinientos treinta· ordinal: 530º
- French
- cinq cent trente· ordinal: cinq cent trentième
- Italian
- cinquecentotrenta· ordinal: 530º
- Latin
- quingenti triginta· ordinal: 530.
- Portuguese
- quinhentos e trinta· ordinal: 530º
Appears in sequences
- a(n) = least m such that if a/b < c/d where a,b,c,d are integers in [0,n], then a/b < k/m < c/d for some integer k.at n=27A001000
- A self-generating sequence: a(1)=1, a(2)=2, a(n+1) chosen so that a(n+1)-a(n-1) is the first number not obtainable as a(j)-a(i) for 1<=i<j<=n.at n=27A001149
- a(n) = sigma_2(n): sum of squares of divisors of n.at n=22A001157
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 20, 50 cents.at n=53A001313
- Sum of totient function: a(n) = Sum_{k=1..n} phi(k), cf. A000010.at n=41A002088
- Numbers k such that 21*2^k - 1 is prime.at n=14A002238
- Take solution to Pellian equation x^2 - n*y^2 = 1 with smallest positive y and x >= 0; sequence gives a(n) = x, or 1 if n is a square. A002349 gives values of y.at n=58A002350
- a(n) = n^2 + 1.at n=23A002522
- Numbers that are the sum of 5 positive 4th powers.at n=32A003339
- G.f.: 1/((1-x)*(1-x^2)*(1-x^3)^2*(1-x^4)*(1-x^5)).at n=21A003402
- a(0) = 1, a(n) = sum of digits of all previous terms.at n=52A004207
- Untouchable numbers, also called nonaliquot numbers: impossible values for the sum of aliquot parts function (A001065).at n=41A005114
- Representation degeneracies for Neveu-Schwarz strings.at n=13A005300
- Number of integer partitions of n whose smallest part is equal to the number of parts.at n=52A006141
- Related to enumeration of rooted maps.at n=2A006303
- a(n+1) = a(n) + sum of digits of a(n), with a(1)=7.at n=47A006507
- Solution to a Pellian equation: least x such that x^2 - n*y^2 = +- 1.at n=58A006702
- Solution to Pellian: x such that x^2 - n y^2 = +- 1, +- 4.at n=58A006704
- Record number of steps to reach 1 in '3x+1' problem, corresponding to starting values in A006877.at n=45A006878
- An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=21A007333