11006
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16512
- Proper Divisor Sum (Aliquot Sum)
- 5506
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5502
- Möbius Function
- 1
- Radical
- 11006
- 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
- 174
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 80.at n=39A020419
- Cube root of A030683.at n=28A030684
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=3A045156
- Numbers k such that d(k) + d(k+1) + d(k+2) = 8, where d(k) = A001223.at n=41A064026
- Number of compositions of n where the smallest part is greater than the number of parts.at n=46A098132
- Number of 1's in n-th "Kolakoski" string defined in A054349.at n=23A111124
- Number of UUDD's, where U=(1,1) and D=(1,-1), in all hill-free Dyck paths of semilength n (a hill in a Dyck path is a peak at level 1).at n=8A116914
- Numbers beginning with a vowel in French.at n=8A118557
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 3 and 6.at n=47A136812
- Triangle T(n,k) read by rows, matrix product of A046899(row-reversed) * A130595.at n=46A158815
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210204; see the Formula section.at n=50A210203
- Number of partitions of n such that (number of distinct parts) = maximal multiplicity of the parts.at n=46A239964
- Row sums of A238498.at n=13A272080
- Sum over all partitions of n into distinct parts of the bitwise XOR of the parts.at n=36A306925
- Number of row states in an automaton for the enumeration of the number of fixed polyominoes with bounding box of width n.at n=10A378947
- Indices where the cumulative sum of sin(2k+1)^(2k+1) reaches a record high value.at n=5A387706