2233
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2880
- Proper Divisor Sum (Aliquot Sum)
- 647
- 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
- 1680
- Möbius Function
- -1
- Radical
- 2233
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 138
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n into at most 5 parts.at n=43A001401
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^7 in powers of x.at n=29A001485
- From a nim-like game.at n=28A003413
- a(n) = n*(n+1)*(n+8)/6.at n=21A006503
- Nearest integer to Gamma(n + 5/7)/Gamma(5/7).at n=7A020030
- Ceiling of Gamma(n+5/7)/Gamma(5/7).at n=7A020120
- Pseudoprimes to base 12.at n=17A020140
- Place where n-th 1 occurs in A023127.at n=42A022789
- Number of partitions of n into parts of 21 kinds.at n=3A023019
- Numbers k such that Fib(k) == 13 (mod k).at n=18A023178
- a(n) = sum of the numbers between the two n's in A026276.at n=43A026279
- a(n) = position of the n-th n in A026400.at n=43A026403
- Number of partitions of n in which the greatest part is 5.at n=48A026811
- Numbers using only digits 2 and 3.at n=17A032810
- Every run of digits of n in base 10 has length 2.at n=20A033008
- Numbers whose base-10 expansion has no run of digits with length < 2.at n=31A033023
- Sorted number reached from A033863(n) by Sort-then-add.at n=4A033864
- Nonprime; becomes prime if any digit is deleted (zeros not allowed in the number).at n=34A034304
- Number of partitions of n into parts not of the form 15k, 15k+4 or 15k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=28A035958
- Number of partitions of n into parts not of the form 17k, 17k+5 or 17k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=27A035966