11567
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11880
- Proper Divisor Sum (Aliquot Sum)
- 313
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11256
- Möbius Function
- 1
- Radical
- 11567
- 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
- 130
- 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
- G.f.: (1 + x^3 + x^4 + ... + x^12 + x^15)/Product_{i=1..10} (1 - x^i).at n=29A003403
- Numbers whose base-5 representation contains exactly three 2's and three 3's.at n=17A045277
- Triangle of number of falls in set partitions of n.at n=46A056859
- a(n) = 10*n^2 + 7.at n=34A061722
- Integers k > 10577 such that the 'Reverse and Add!' trajectory of k joins the trajectory of 10577.at n=0A063434
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.at n=38A064909
- a(n) = Sum_{k=1..phi(n)-1} t(n,k)*t(n,k+1), where t(n,k) is the k-th positive integer which is coprime to n and phi(n) is the number of positive integers which are <= n and are coprime to n.at n=38A119584
- Start with i=1 and j=2. Concatenate i and j, get k = floor(ij/j), concatenate j and k, etc.at n=21A127320
- a(n) = 100*n^2 - 49*n + 6.at n=10A157651
- Coefficients in the expansion of C^2/B^3, in Watson's notation of page 106.at n=13A160462
- Number of parts in all partitions of n in which no part occurs more than twice.at n=33A185350
- Triangle T(n,k) read by rows: left edge is 0, 1, 2, ... (cf. A001477); otherwise each entry is sum of entry to left and entries immediately above it to left and right, with 1 for the missing right term at right edge.at n=34A224791
- Number of 2Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=12A241436
- Number T(n,k) of collections of nonempty multisets with a total of n objects of exactly k colors; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=48A255903
- Number of collections of nonempty multisets with a total of n objects of exactly three colors.at n=6A255943
- Number of collections of nonempty multisets with a total of n+6 objects of exactly n colors.at n=3A255956
- Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 4.at n=21A296811
- Numbers whose multiset multisystem (A302242) is crossing.at n=25A324170
- MM-numbers of crossing set partitions.at n=10A324324
- Least k such that A000790(k) = A108574(n).at n=25A326610