170
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
- 324
- Proper Divisor Sum (Aliquot Sum)
- 154
- 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
- 64
- Möbius Function
- -1
- Radical
- 170
- 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
- 10
- 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
- einshundertsiebzig· ordinal: einshundertsiebzigste
- English
- one hundred seventy· ordinal: one hundred seventieth
- Spanish
- ciento setenta· ordinal: 170º
- French
- cent soixante-dix· ordinal: cent soixante-dixième
- Italian
- centosettanta· ordinal: 170º
- Latin
- centum septuaginta· ordinal: 170.
- Portuguese
- cento e setenta· ordinal: 170º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=38A000008
- Number of n-bead necklaces with beads of 2 colors and primitive period n, when turning over is not allowed but the two colors can be interchanged.at n=12A000048
- Numbers k such that (2k)^4 + 1 is prime.at n=47A000059
- Generalized tangent numbers d(n,1).at n=58A000061
- a(n) = n*(n+3)/2.at n=17A000096
- Number of partitions of n if there are two kinds of 1's and two kinds of 2's.at n=9A000097
- From a fractal set of positive Lebesgue measure, a self-replicating tiling with holes, the 4-reptile following the 2-reptile of Paul Levy.at n=20A000361
- From a fractal set of positive Lebesgue measure, a self-replicating tiling with holes, the 4-reptile following the 2-reptile of Paul Levy.at n=41A000361
- From a fractal set of positive Lebesgue measure, a self-replicating tiling with holes, the 4-reptile following the 2-reptile of Paul Levy.at n=26A000361
- Numbers that are the sum of 2 nonzero squares.at n=58A000404
- Numbers that are the sum of 2 but no fewer nonzero squares.at n=55A000415
- Expansion of Product_{k >= 1} (1 - x^k)^6.at n=39A000729
- From a self-replicating tiling.at n=62A000876
- a(2n) = 2*a(2n-1), a(2n+1) = 2*a(2n)+1 (also a(n) is the n-th number without consecutive equal binary digits).at n=8A000975
- Numbers that are divisible by at least three different primes.at n=23A000977
- Length of one version of Kolakoski sequence {A000002(i)} at n-th growth stage.at n=13A001083
- a(n) = sigma_2(n): sum of squares of divisors of n.at n=12A001157
- Image of n under the map n->n/2 if n even, n->3n-1 if n odd.at n=57A001281
- Triangle read by rows, in which row n consists of n(n+m) for m = 1 .. n-1.at n=42A001283
- Numbers of form m*k with m+1 <= k <= 2m-1.at n=47A001284