210
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 3
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 576
- Proper Divisor Sum (Aliquot Sum)
- 366
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- yes
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 48
- Möbius Function
- 1
- Radical
- 210
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- yes
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- yes
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- yes
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- yes
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 39
- 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
- zweihundertzehn· ordinal: zweihundertzehnste
- English
- two hundred ten· ordinal: two hundred tenth
- Spanish
- doscientos diez· ordinal: 210º
- French
- deux cent dix· ordinal: deux cent dixième
- Italian
- duecentodieci· ordinal: 210º
- Latin
- ducenti decem· ordinal: 210.
- Portuguese
- duzentos e dez· ordinal: 210º
Appears in sequences
- Coefficients of ménage hit polynomials.at n=5A000033
- Numbers k such that k^4 + 1 is prime.at n=31A000068
- Pentagonal numbers: a(n) = n*(3*n-1)/2.at n=12A000326
- Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.at n=10A000332
- Number of ways to pair up {1..2n} so sum of each pair is prime.at n=6A000341
- a(n) = Sum_{k=1..n-1} k*sigma(k)*sigma(n-k).at n=5A000441
- Associated Stirling numbers: second-order reciprocal Stirling numbers (Fekete) a(n) = [[n, 3]]. The number of 3-orbit permutations of an n-set with at least 2 elements in each orbit.at n=1A000483
- Number of labeled trees of diameter 3 with n nodes.at n=2A000554
- Figurate numbers or binomial coefficients C(n,6).at n=10A000579
- Number of monosubstituted alkanes C(n)H(2n+1)-X of the form shown in the Comments lines that are not stereoisomers.at n=13A000624
- Number of paraffins C_n H_{2n} X Y with n carbon atoms.at n=7A000635
- Expansion of Product_{k >= 1} (1 - x^k)^6.at n=34A000729
- Expansion of Product_{k >= 1} (1 - x^k)^6.at n=58A000729
- Number of compositions of n into 5 ordered relatively prime parts.at n=6A000743
- Landau's function g(n): largest order of permutation of n elements. Equivalently, largest LCM of partitions of n.at n=17A000793
- Landau's function g(n): largest order of permutation of n elements. Equivalently, largest LCM of partitions of n.at n=18A000793
- Number of twin prime pairs < square of n-th prime.at n=25A000885
- Exponential generating function: 2*(1+3*x)/(1-2*x)^(7/2).at n=2A000906
- Euler's "numerus idoneus" (or "numeri idonei", or idoneal, or suitable, or convenient numbers).at n=46A000926
- The convergent sequence A_n for the ternary continued fraction (3,1;2,2) of period 2.at n=9A000962