3210
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 7776
- Proper Divisor Sum (Aliquot Sum)
- 4566
- 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
- 848
- Möbius Function
- 1
- Radical
- 3210
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 22
- Smith Number
- no
- Vampire 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
Appears in sequences
- Numbers whose sum of divisors is a fifth power.at n=5A019423
- Coordination sequence T3 for Zeolite Code CZP.at n=37A019458
- a(1) = 3; a(n+1) = a(n)-th composite.at n=24A022451
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 2), t = (Fibonacci numbers).at n=13A024309
- n written in fractional base 4/3.at n=12A024631
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 2), t = (Fibonacci numbers).at n=12A024872
- a(n) = [ 2nd elementary symmetric function of {log(k)} ], k = 2,3,...,n.at n=29A025202
- a(n) = T(2n-1,n), where T is the array in A026098.at n=27A026102
- Number of necklaces with n beads of 3 colors, allowing turning over.at n=10A027671
- Numbers k such that A174141(k) is divisible by k.at n=29A032581
- Decimal part of a(n)^(1/2) starts with reversal of its integer part: first term of runs.at n=40A034308
- Number of partitions of n into parts not of form 4k+2, 20k, 20k+3 or 20k-3. Also number of partitions in which no odd part is repeated, with 1 part of size less than or equal to 2 and where differences between parts at distance 4 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=44A036025
- Positive numbers having the same set of digits in base 5 and base 10.at n=26A037433
- Decimal expansion of a(n) is given by the first n terms of the periodic sequence with initial period 3,2,1,0.at n=3A037799
- Differences of A038011.at n=25A038012
- Number of partitions with at most one part divisible by 5.at n=27A039905
- Numbers k such that the string 5,6 occurs in the base 9 representation of k but not of k-1.at n=43A044302
- Numbers k such that the string 1,0 occurs in the base 10 representation of k but not of k-1.at n=31A044342
- Numbers n such that string 2,1 occurs in the base 10 representation of n but not of n-1.at n=35A044353
- Numbers n such that string 1,0 occurs in the base 10 representation of n but not of n+1.at n=31A044723