11580
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
- 24
- Divisor Sum
- 32592
- Proper Divisor Sum (Aliquot Sum)
- 21012
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3072
- Möbius Function
- 0
- Radical
- 5790
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 55
- 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
- Binomial transform of A000031.at n=10A054185
- Numbers that define integer Heronian triangles [prime(a(n)), prime(a(n)+1), A068965(n)] with area A068966(n).at n=18A068964
- Number of meaningful differential operations of the n-th order on the space R^10.at n=12A090995
- Numbers n such that 2*prime(n) - prime(n+1) is a square.at n=46A110975
- Elias omega coded prime numbers represented in decimal.at n=21A147764
- Coefficients of powers of x^2 of polynomials, called h(2,n,x^2), appearing in a conjecture on alternating sums of fifth powers of odd-indexed Chebyshev S polynomials stated in A220671.at n=29A220672
- Smallest number k such that k*n +/- 1, k*n^2 +/- 1, and k*n^3 +/- 1 are three sets of twin primes. a(n) = 0 if no such number exists.at n=7A239021
- Expansion of (H(-x) / chi(-x))^2 in powers of x where chi() is a Ramanujan theta function and G() is a Rogers-Ramanujan function.at n=24A261526
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) + 2*n, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=14A294558
- Numbers that are not Keith numbers in any base.at n=19A320122
- Number of ways to split a strict integer partition of n into consecutive subsequences of equal length.at n=51A323434
- Number of compositions (ordered partitions) of n into distinct parts where no part is a multiple of 5.at n=30A332311
- Array read by antidiagonals: T(n,m) is the number of maximal matchings in the rook graph K_n X K_m.at n=39A341847
- Array read by antidiagonals: T(n,m) is the number of maximal matchings in the rook graph K_n X K_m.at n=41A341847
- Number of maximal matchings in the 3 X n rook graph.at n=5A341848
- Triangle read by rows: T(n,k), where n, k >= 2, is the number of n-element unlabeled connected series-parallel posets with k ordinal terms that are either the singleton or disconnected posets.at n=47A356558
- G.f.: Sum_{k>=0} x^(k*(k+1)/2) / Product_{j=1..k} (1 - x^(2*j-1))^2.at n=37A376624
- Irregular triangle read by rows: T(n,k) is the number of polyominoes of size k, i.e., connected subsets of k square cells (or vertices), of the n X n flat torus, up to cyclic shifts and reflections of rows and columns, as well as interchange of rows and columns; 1 <= k <= n^2.at n=44A385385