670
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1224
- Proper Divisor Sum (Aliquot Sum)
- 554
- 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
- 264
- Möbius Function
- -1
- Radical
- 670
- 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
- 69
- 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
- sechshundertsiebzig· ordinal: sechshundertsiebzigste
- English
- six hundred seventy· ordinal: six hundred seventieth
- Spanish
- seiscientos setenta· ordinal: 670º
- French
- six cent soixante-dix· ordinal: six cent soixante-dixième
- Italian
- seicentosettanta· ordinal: 670º
- Latin
- sescenti septuaginta· ordinal: 670.
- Portuguese
- seiscentos e setenta· ordinal: 670º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 20, 50 cents.at n=57A001313
- a(n) is the cutting number of the tree corresponding to A002887(n).at n=4A002888
- The square sieve.at n=45A002960
- Number of rhyme schemes (see reference for precise definition).at n=4A005003
- Erroneous version of A226999.at n=16A005170
- Least k such that binomial(k,n) has n or more distinct prime factors.at n=26A005733
- Octahedral numbers: a(n) = n*(2*n^2 + 1)/3.at n=10A005900
- Expansion of (1+x^2)/((1-x)^2*(1-x^2)^2).at n=18A005993
- Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.at n=18A007077
- Number of planted trees: all sub-rooted trees from any node are identical; non-root, non-leaf nodes an even distance from the root are of degree 2.at n=49A007439
- Coordination sequence T5 for Zeolite Code AET.at n=18A008011
- Coordination sequence T8 for Zeolite Code EUO.at n=16A008103
- Coordination sequence T4 for Zeolite Code FER.at n=16A008109
- Coordination sequence T3 for Zeolite Code HEU.at n=17A008118
- Coordination sequence T3 for Zeolite Code MEI.at n=19A008148
- At least 3 out of 10m+1, 10m+3, 10m+7, 10m+9 are primes.at n=54A008470
- Coordination sequence T6 for Zeolite Code DFO.at n=20A009880
- exp(tan(x)*arcsin(x))=1+2/2!*x^2+24/4!*x^4+670/6!*x^6+33320/8!*x^8...at n=3A012375
- arcsin(arcsinh(x)*exp(x))=x+2/2!*x^2+3/3!*x^3+12/4!*x^4+93/5!*x^5...at n=5A012586
- exp(arctanh(x)*sinh(x)) = 1+2/2!*x^2+24/4!*x^4+670/6!*x^6+34664/8!*x^8...at n=3A012750