11588
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 20286
- Proper Divisor Sum (Aliquot Sum)
- 8698
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5792
- Möbius Function
- 0
- Radical
- 5794
- Omega Function (Ω)
- 3
- 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
- 143
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Difference between nearest integer to Li(10^n) and pi(10^n), where Li(x) = integral of log(x) and pi(10^n) = number of primes <= 10^n (A006880).at n=10A057752
- Number of solutions (x,y,z,u,v,w) to x+y+z = u+v+w, 0<=x,y,z,u,v,w<=n-1, x>=y>=z, u>=v>=w.at n=13A071009
- Permanent of the n X n matrix M where M(i,i) = 0 and for i != j, M(i,j) = mu(|i-j|) where mu( ) is the moebius function.at n=12A086095
- G.f. A(x) equals the composition of functions x*(1 + a(n)*x^n); let F_1(x) = x, F_{n+1}(x) = F_n( x*(1 + a(n)*x^n) ), then A(x) = limit F_n(x): A(x) = x*(1+a(1)*x) o x*(1+a(2)*x^2) o ... o x*(1+a(n)*x^n) o ...at n=11A119472
- List of different composites in Pascal-like triangles with index of asymmetry y = 3 and index of obliqueness z = 0 or z = 1.at n=35A141069
- List of central integer pairs in Pascal-like triangles with index of asymmetry y = 3 and index of obliqueness z = 0 or z = 1.at n=24A141073
- List of central integer pairs in Pascal-like triangles with index of asymmetry y = 3 and index of obliqueness z = 0 or z = 1.at n=27A141073
- Number of slanted n X 4 (i=1..n) X (j=i..4+i-1) 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 3 neighbors with the same value.at n=6A165381
- Number of slanted 8Xn (i=1..8)X(j=i..n+i-1) 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 3 neighbors with the same value.at n=2A165400
- Partial sums of Sum_{k=1..n} n/gcd(n,k), or partial sums of Sum_{d|n} d*phi(d) (see A057660).at n=35A174405
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=32A181882
- Number of subsets of {1, 2, ..., n} containing n and having <=7 pairwise coprime elements.at n=28A186991
- Convolution of Fibonacci numbers and positive integers repeated three times (A000045 and A008620).at n=19A213044
- Integers k such that (k^2 + (k+1)^2) has no square proper substring.at n=61A238903
- T(n,k)=Number of nXk 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 zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=58A240792
- Number of 4Xn 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 zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=7A240795
- Multiply a(n-1) by 2 and drop all 0's.at n=23A242350
- Numbers that are not the difference of two binary palindromes (A006995).at n=30A290393
- Limiting row sequence for Pascal-like triangle A140995 (Stepan's triangle with index of asymmetry s = 3).at n=13A309462
- Number of 4-element subsets of [n] having a prime element sum.at n=31A320679