4223
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4368
- Proper Divisor Sum (Aliquot Sum)
- 145
- 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
- 4080
- Möbius Function
- 1
- Radical
- 4223
- 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
- 157
- 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
- (Presumed) solution to Waring's problem: g(n) = 2^n + floor((3/2)^n) - 2.at n=11A002804
- Coordination sequence T10 for Zeolite Code EUO.at n=40A008096
- Coordination sequence T2 for Zeolite Code YUG.at n=42A008248
- a(n) = T(n,1) + T(n-1,2) + ...+ T(n-k+1,k), where k = floor((n+1)/2) and T is the array defined in A026098.at n=27A026103
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 63.at n=22A031561
- Number of partitions of n into parts not of form 4k+2, 20k, 20k+7 or 20k-7. Also number of partitions in which no odd part is repeated, with at most 3 parts 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=42A036027
- a(n) = least number not of form [ (a^2+b^2)/n ].at n=23A036574
- Numerators of continued fraction convergents to sqrt(469).at n=5A041894
- Numbers whose base-5 representation contains exactly two 1's and three 3's.at n=23A045243
- Numbers k such that 111*2^k-1 is prime.at n=32A050581
- Composite numbers x such that sigma(x+120) = sigma(x)+120.at n=18A054985
- Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the 4th power of the number of divisors of k.at n=16A055468
- Expansion of series related to Liouville's Last Theorem: g.f. Sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^3 *Product_{i=1..t} (1-x^i) ).at n=32A059820
- Numbers n such that sigma(n+1)=3*phi(n).at n=48A067261
- a(n) = 4*n^2 + 4*n - 1.at n=31A073577
- Numbers given by the Rule 225 Cellular Automaton.at n=46A078176
- Index of the first occurrence of prime(n) in A060324.at n=32A078454
- a(n) = (prime(n)+1)*n - 1.at n=31A083723
- Numbers k such that sigma(phi(k))-phi(sigma(k)) is nonzero and divisible by phi(k), that is A065395(k)/A000010(k) is a nonzero integer.at n=30A092587
- a(n) = (2^n + 1)^2 - 2.at n=5A093069