11350
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21204
- Proper Divisor Sum (Aliquot Sum)
- 9854
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4520
- Möbius Function
- 0
- Radical
- 2270
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- Number of partitions of n into parts not of the form 21k, 21k+10 or 21k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=35A035988
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5) and cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5)).at n=53A036817
- Triangle T(n,k) of k-block ordered bicoverings of an unlabeled n-set, n >= 2, k = 3..n+floor(n/2).at n=15A060092
- Number of 6-block ordered bicoverings of an unlabeled n-set.at n=6A060094
- Record entries in A065191.at n=49A065192
- Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 8064.at n=11A077096
- Total number of prime parts in all compositions of n.at n=13A102291
- Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n then a(n) is the trace of M(n)^(-6).at n=13A114358
- a(n) = floor(Fibonacci(n)/n).at n=27A127884
- G.f. satisfies: A(x) = Sum_{n>=0} x^n*A(x)^(n(3n-1)/2).at n=7A177340
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=35A191111
- Number of (w,x,y) with all terms in {0,...,n} and w<x+y and x<=y.at n=29A212982
- Number of (6+2) X (n+2) 0..3 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=23A252725
- Number of (n+2)X(3+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 or 00000101.at n=10A259767
- Anagraprod Integers. Integers N that reproduce their multiset of digits when all the products of two successive digits of N are done (and considered together).at n=49A296451
- a(n) is the smallest number not occurring earlier whose concatenation with the previous term contains the smallest possible number of numeric substrings strictly larger than for the preceding term; a(0) = 0.at n=29A307511
- Number of integer partitions of n whose length (number of parts) is equal to the sum of some submultiset.at n=34A367212