11075
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 13764
- Proper Divisor Sum (Aliquot Sum)
- 2689
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8840
- Möbius Function
- 0
- Radical
- 2215
- 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
- 68
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = (primes).at n=25A025117
- a(n) = Sum_{j=0..n} Sum_{i=0..n} T(j,i), T given by A026736.at n=12A026745
- Number of ternary codes of length 5 with n words.at n=5A034217
- Number of ternary codes (not necessarily linear) of length n with 5 words.at n=4A034225
- Expansion of (3 + x^2) / (1 - x)^4.at n=24A037237
- Numbers n such that n | 10^n + 9^n + 1.at n=29A057295
- Numbers m such that [A070080(m), A070081(m), A070082(m)] is an acute scalene integer triangle with prime side lengths.at n=32A070123
- Positive integers i for which A112049(i) == 7.at n=28A112067
- Array of generalized Eulerian numbers C(n,k) read by antidiagonals.at n=48A211235
- Number of compositions of n where the difference between largest and smallest parts equals one.at n=19A214259
- a(n) is the number of terms in the expansion of (x-y)*(x^4-y^4)*(x^9-y^9)*...*(x^(n^2)-y^(n^2)).at n=31A225549
- Smallest k such that the union of {A242033(i): 1 <= i <= k} and {A242034(i): 1 <= i <= k} includes all primes {3, ..., prime(n)}.at n=44A242064
- Smallest k such that the union of {A242033(i): 1 <= i <= k} and {A242034(i): 1 <= i <= k} includes all primes {3, ..., prime(n)}.at n=45A242064
- Seventh partial sums of sixth powers (A001014).at n=3A254872
- Fixed points of permutations A256210 and A256371.at n=16A256372
- a(n) = Sum_{k=0..n} binomial(n,k) * binomial(n+k-1,n-k).at n=7A262440
- Number of nX4 0..1 arrays with every element equal to 1, 2, 4 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=7A300635
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=58A300639
- Numbers missing from A317416.at n=6A317418
- Number of integer partitions of n with no part dividing all the others.at n=44A338470