3233
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
- 3348
- Proper Divisor Sum (Aliquot Sum)
- 115
- 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
- 3120
- Möbius Function
- 1
- Radical
- 3233
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 167
- 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
- a(n) = n concatenated with n + 1.at n=31A001704
- Expansion of 1/(1-x^2-x^3-x^4-x^5-x^6-x^7).at n=20A013984
- Numbers k such that the continued fraction for sqrt(k) has period 11.at n=30A020350
- Numbers k such that Fib(k) == 13 (mod k).at n=22A023178
- Discriminants of quintic fields with 4 complex conjugates.at n=10A023685
- Coordination sequence T4 for Zeolite Code IFR.at n=40A024985
- Pair up the numbers.at n=16A030656
- Positions of record values in A030777.at n=49A030782
- Numbers using only digits 2 and 3.at n=25A032810
- Euler transform of powers of 2 [1,2,4,8,16,...].at n=10A034691
- Concatenation of two or more consecutive positive integers.at n=40A035333
- Number of partitions of n into parts not of the form 23k, 23k+6 or 23k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=28A035994
- Number of partitions satisfying (cn(0,5) = 0 and cn(1,5) = cn(4,5)).at n=44A036818
- Denominators of continued fraction convergents to sqrt(221).at n=6A041413
- Numbers having three 3's in base 10.at n=5A043503
- Numbers k such that the string 8,2 occurs in the base 9 representation of k but not of k-1.at n=43A044325
- Numbers n such that string 3,3 occurs in the base 10 representation of n but not of n-1.at n=32A044365
- Numbers n such that string 3,3 occurs in the base 10 representation of n but not of n+1.at n=32A044746
- a(n)=T(n,1), array T as in A049735.at n=32A049744
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.at n=14A049885