570
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 1440
- Proper Divisor Sum (Aliquot Sum)
- 870
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 144
- Möbius Function
- 1
- Radical
- 570
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 105
- 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ünfhundertsiebzig· ordinal: fünfhundertsiebzigste
- English
- five hundred seventy· ordinal: five hundred seventieth
- Spanish
- quinientos setenta· ordinal: 570º
- French
- cinq cent soixante-dix· ordinal: cinq cent soixante-dixième
- Italian
- cinquecentosettanta· ordinal: 570º
- Latin
- quingenti septuaginta· ordinal: 570.
- Portuguese
- quinhentos e setenta· ordinal: 570º
Appears in sequences
- Number of free planar polyenoids with n nodes and symmetry point group C_s.at n=9A000941
- Expansion of g.f. (1 + x + 2*x^2)/((1 - x)^2*(1 - x^3)).at n=28A000969
- Smallest even number that is an unordered sum of two odd primes in exactly n ways.at n=31A001172
- Number of ways of making change for n cents using coins of 1, 2, 4, 12, 24, 48, 96, 120 cents (based on English coinage of 1939).at n=54A001364
- Number of ways of making change for n cents using coins of 1, 2, 4, 12, 24, 48, 96, 120 cents (based on English coinage of 1939).at n=55A001364
- Expansion of 1/(1-x)^2/(1-x^2)/(1-x^6)/(1-x^12)/(1-x^24)/(1-x^48)/(1-x^60).at n=27A001365
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^6 in powers of x.at n=29A001484
- Expansion of g.f. x/((1 - x)^2*(1 - x^3)).at n=57A001840
- Numbers dividing A002037(i) and larger than A002037(i-1), for some i>0.at n=49A002038
- Smallest number of stones in Tchoukaillon (or Mancala, or Kalahari) solitaire that make use of n-th hole.at n=41A002491
- Beginnings of periodic unitary aliquot sequences.at n=47A003062
- Stern's sequence: a(1) = 1, a(n+1) is the sum of the m preceding terms, where m*(m-1)/2 < n <= m*(m+1)/2 or equivalently m = ceiling((sqrt(8*n+1)-1)/2) = A002024(n).at n=11A005230
- a(n) = n*(5*n+1)/2.at n=15A005475
- Start with 4; if k appears then so do 2k+2 and 3k+3. (duplicates omitted.)at n=51A005662
- a(n) is the smallest positive integer a for which there is an identity of the form a*n*x = Sum_{i=1..m} ai*gi(x)^n where a1, ..., am are in Z and g1(x), ..., gm(x) are in Z[x].at n=19A005729
- Molien series for a certain group of order 52.at n=54A005916
- Expansion of (1+x^2)/((1-x)^2*(1-x^2)^2).at n=17A005993
- a(n) = n*(n+1)*(2*n+1)/3.at n=9A006331
- Expansion of a cusp form of weight 8 for Gamma_1(6).at n=4A006354
- a(n+1) = a(n)-th composite number, with a(0) = 1.at n=15A006508