11049
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15360
- Proper Divisor Sum (Aliquot Sum)
- 4311
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7056
- Möbius Function
- -1
- Radical
- 11049
- 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
- 68
- 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
- Divisors of 2^28 - 1.at n=28A003536
- [ n(n-1)(n-2)(n-3)/13 ].at n=21A011923
- Length of n-th string generated by a Kolakoski(9,1) rule starting with a(1)=1.at n=10A095344
- a(n) = a(n-1) + 2*n^2 with a(1) = 1.at n=24A112524
- The Wiener index of a benzenoid consisting of a linear chain of n hexagons.at n=11A143938
- 3 times 11-gonal (or hendecagonal) numbers: a(n) = 3*n*(9*n-7)/2.at n=29A153783
- Numbers n with property that there is a different number m such that the lunar squares n*n and m*m are the same.at n=35A181319
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k cycles with 2 alternating runs (it is assumed that the smallest element of the cycle is in the first position), 0<=k<=floor(n/3).at n=16A187244
- Number of 5-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and first differences in -n..n.at n=14A209033
- Indices of positive Fibonacci numbers whose binary expansions have record numbers of consecutive zeros.at n=13A218076
- Pairs of nodes in a complete binary tree that are at an absolute height difference of less than 2 from each other.at n=6A251743
- Least inverse of A073454: Smallest m such that m divided by the primes up to m have exactly n repeated residues.at n=17A274320
- Numbers n such that the decimal equivalent of the binary reflected Gray code representation of n is a palindromic prime.at n=29A281382
- Number of nX2 0..1 arrays with no 1 equal to more than three of its king-move neighbors.at n=6A282393
- Number of nX7 0..1 arrays with no 1 equal to more than three of its king-move neighbors.at n=1A282398
- T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than three of its king-move neighbors.at n=29A282399
- T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than three of its king-move neighbors.at n=34A282399
- Nonprime numbers k of the form 4*m+1 such that Sum_{j=0..k-1} 2^j * binomial(3*j, j) == 1 (mod k).at n=22A373747
- a(n) is the unique nonnegative integer whose binary expansion is the parity sequence of the Collatz orbit of n, interpreted through a particular conjugacy (see Comments).at n=8A389685
- Odd composites k with more than 2 prime factors for which it holds that k = A048720(k/d, A065621(d)), for all divisor pairs (d, k/d), d <= k/d.at n=1A391252