4233
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6048
- Proper Divisor Sum (Aliquot Sum)
- 1815
- 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
- 2624
- Möbius Function
- -1
- Radical
- 4233
- 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
- 201
- 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
- Heptagonal (or 7-gonal) pyramidal numbers: a(n) = n*(n+1)*(5*n-2)/6.at n=17A002413
- Coordination sequence T1 for Zeolite Code ACO, ASV, EDI, and THO.at n=46A008084
- Coordination sequence T2 for Zeolite Code MTN.at n=39A008187
- Coordination sequence T2 for Zeolite Code THO.at n=46A008239
- Expansion of Product_{k>=1} (1 - x^k)^17.at n=7A010823
- Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(4,11).at n=7A019495
- a(n) = 3*a(n-1) - 3*a(n-3) + 2*a(n-4), with a(0)=4, a(1)=11.at n=7A019496
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6,..., 1/2n} satisfy r < s, then r < k/m < s for some integer k.at n=51A024820
- Duplicate of A008084.at n=46A033598
- Positive numbers having the same set of digits in base 3 and base 8.at n=42A037420
- Denominators of continued fraction convergents to sqrt(641).at n=8A042231
- Numbers having four 3's in base 6.at n=4A043384
- Numbers n such that A048767(n+1)=A048767(n).at n=9A048769
- Starting positions of strings of 2 2's in the decimal expansion of Pi.at n=39A050215
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(17)).at n=43A052479
- Duplicate of A008084.at n=46A057310
- Numbers k such that x^k + x^5 + 1 is irreducible over GF(2).at n=24A057474
- Each permutation in the list A060117 converted to Site Swap notation, with "zero throws" (fixed elements) replaced with n, the length of siteswap.at n=14A060495
- Numbers k such that the smoothly undulating palindromic number (38*10^k - 83)/99 is a prime.at n=6A062220
- Numbers k such that sopf(k) + 1 = sopf(k+1), where sopf(k) = A008472(k).at n=13A064111