6210
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 11070
- 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
- 1584
- Möbius Function
- 0
- Radical
- 690
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 155
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
Appears in sequences
- Number of n X n matrices with nonnegative entries and every row and column sum 2.at n=5A000681
- Number of 5 X 5 matrices with nonnegative integer entries and row and column sums equal to n.at n=2A003438
- a(n) = n*(17*n + 1)/2.at n=27A022275
- a(n) = n*(31*n + 1)/2.at n=20A022289
- Fibonacci sequence beginning 4, 14.at n=14A022383
- Convolution of Fibonacci numbers and A001950.at n=13A023612
- Number of days in n years (n=1 is the first leap year).at n=16A033174
- Number of triples {i,j,k}, i>1, j>1, k>1, such that i*j*k < n^3.at n=11A037092
- Numbers k such that k | sigma_11(k).at n=20A055715
- Sum of the remainders when n^2 is divided by squares less than n.at n=36A067459
- Numbers k such that tau_3(k) (the number of ordered factorizations of k as k = r*s*t) divides k.at n=29A069147
- Number of triangular partitions of n of order 5.at n=11A084447
- Expansion of (1+4x+7x^2)/((1-x)^2*(1-x^2)).at n=45A090381
- G.f.: (1+3*x^3)/((1-x)^2*(1-x^3)^2).at n=42A092352
- Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime.at n=18A097387
- Number of edges in LCM of graphs K_n and C_4.at n=45A098585
- Expansion of (eta(q^5) / eta(q))^6 in powers of q.at n=7A121591
- Numbers k for which nontrivial positive magic squares of exactly 8 different orders with magic sum k exist. For a definition of nontrivial positive magic squares, see A125005.at n=23A125015
- Triangle read by rows: T(n,k) is the number of hex trees with n edges and k pairs of adjacent vertices of outdegree 2.at n=15A126188
- a(n) = n * A062949(n).at n=45A127469