6033
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8048
- Proper Divisor Sum (Aliquot Sum)
- 2015
- 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
- 4020
- Möbius Function
- 1
- Radical
- 6033
- 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
- 41
- 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
- Position of n^3 + 9 in A024975.at n=37A024979
- 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 50.at n=39A031548
- (s(n)+1)/9, where s(n)=n-th base 9 palindrome that starts with 8.at n=42A043079
- a(1) = 5; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=40A046255
- Number of score sequences in tournament with n players, when 8 points are awarded in each game.at n=4A047735
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049747.at n=33A049750
- Smallest composite that when added to sum of prime factors reaches a prime after n iterations.at n=29A050710
- Binomial transform of A000011.at n=10A054198
- a(n) = sum of modular offsets: mod[n+c,b]-(mod[n,b]+c) for c<=b<=n.at n=37A066809
- Square root of coefficients of power series: A083352(x)^2 + A083352(x) - 1; term-by-term square root of A083353.at n=76A083354
- Semiprimes a such that there exist three semiprimes b, c and d with a^3=b^3+c^3+d^3.at n=41A113490
- Semiprimes s such that s-/+4 are primes.at n=36A125216
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 11011-01110 pattern in any orientation.at n=14A147229
- Partial sums of A151782.at n=22A151793
- Transform of the finite sequence (1, 0, -1, 0, 1, 0, -1) by the T_{0,1} transform (see link).at n=10A159342
- 1+5*n+7*n^2.at n=28A168235
- Number of tilings of a 5 X n rectangle using n pentominoes of shapes V, U, X, N.at n=18A247127
- Number of (2+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=13A250757
- Decimal representation of the n-th iteration of the "Rule 75" elementary cellular automaton starting with a single ON (black) cell.at n=8A266894
- First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 283", based on the 5-celled von Neumann neighborhood.at n=40A271120