4321
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4500
- Proper Divisor Sum (Aliquot Sum)
- 179
- 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
- 4144
- Möbius Function
- 1
- Radical
- 4321
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 170
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Concatenation of numbers from n down to 1.at n=3A000422
- Genus of modular group Gamma(n) = genus of modular curve Chi(n).at n=49A001767
- a(n) = floor(1000*log_2(n)).at n=19A004265
- From solution to a difference equation.at n=4A005924
- Coordination sequence T2 for Zeolite Code MFI.at n=42A008165
- n is equal to the number of 1's in all numbers <= n written in base 6.at n=19A014890
- Number of zeros in numbers 1 to 111...1 (n+1 digits).at n=3A014925
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10).at n=41A017841
- n written in fractional base 5/4.at n=16A024634
- a(n) = least m such that if r and s in {1/2, 1/5, 1/8, ..., 1/(3n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=29A024837
- Numbers that are the sum of 4 distinct positive cubes in exactly 3 ways.at n=12A025410
- Numbers that are the sum of 4 distinct positive cubes in 3 or more ways.at n=12A025413
- Sequence satisfies T^2(a)=a, where T is defined below.at n=53A027587
- Decimal representation of permutations of lengths 1, 2, 3, ... arranged lexicographically.at n=32A030299
- Number of partitions satisfying cn(0,5) + cn(2,5) <= cn(1,5) and cn(0,5) + cn(2,5) <= cn(4,5) and cn(0,5) + cn(3,5) <= cn(1,5) and cn(0,5) + cn(3,5) <= cn(4,5).at n=39A039883
- Denominators of continued fraction convergents to sqrt(634).at n=9A042217
- Expansion of (1-x)/(1-2*x-3*x^2+3*x^3).at n=9A052538
- Append n to the previous term, reverse alternate terms.at n=3A053052
- a(n) = 1 + 2*n + 3*n^2 + 4*n^3.at n=10A056578
- Add (n mod 10)*10^(n-1) to the previous term, with a(0) = 0.at n=4A057138