11280
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 35712
- Proper Divisor Sum (Aliquot Sum)
- 24432
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2944
- Möbius Function
- 0
- Radical
- 1410
- Omega Function (Ω)
- 7
- 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
- 37
- 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
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 11 (most significant digit on right).at n=17A029504
- Ooguri-Vafa invariants of disk domain wall degeneracies for brane I in the O(K) -> P^1 X P^1 geometry.at n=4A061609
- Numbers k such that d(phi(k)) = phi(d(k)), where d=A000005 and phi=A000010.at n=25A078148
- Number of partitions of 2n prime to 3,5 with all odd parts occurring with even multiplicities. There is no restriction on the even parts.at n=33A103259
- Ten times hexagonal numbers: 10*n*(2*n-1).at n=24A144560
- Number of n X n arrays of squares of integers summing to 16 with every element equal to at least one neighbor.at n=2A146503
- a(n) = 512n + 16.at n=21A157475
- Triangle T(n, k) = coefficients of (p(x,n)), where p(x, n) = (n-1)! * Sum_{j=1..n} A142458(n, j)*binomial(x+j-1, n-1), read by rows.at n=22A168295
- G.f. A(x) satisfies A(x) = 1 + x*A(2*x)^5.at n=4A171204
- Numbers of the form p^4*q*r*s where p, q, r, and s are distinct primes.at n=29A179693
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=28A191111
- Number of n X n 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,4,2,0,1 for x=0,1,2,3,4.at n=5A196857
- Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,4,2,0,1 for x=0,1,2,3,4.at n=5A196861
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,4,2,0,1 for x=0,1,2,3,4.at n=60A196863
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 3.at n=29A209986
- Number of s in {1,...,n}^n having shortest run with the same value of length 5.at n=11A228631
- Number of symmetry classes of 3-eared triangulations of an n-gon.at n=11A232492
- Let m_n denote the number which is obtained from n-base representation of m if its digits are written in nondecreasing order; then a(n) is the smallest period of the sequence which is defined by the recurrence b(0)=0, b(1)=1, b(k)=(b(k-1) + b(k-2))_n, for k>=2, or a(n)=0, if there is no such period.at n=39A237671
- Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=49A249074
- Number of (n+1) X (2+1) 0..3 arrays with no 2 X 2 subblock having the sum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=3A251049