11044
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
- 21168
- Proper Divisor Sum (Aliquot Sum)
- 10124
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5000
- Möbius Function
- 0
- Radical
- 5522
- 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
- no
- 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 at most 7 parts.at n=45A008636
- a(n) = dot_product(1,2,...,n)*(4,5,...,n,1,2,3).at n=29A026040
- Number of partitions of n in which the greatest part is 7.at n=52A026813
- a(n) = smallest number > a(n-1) such that a(1)*a(2)*...*a(n) + 1 and a(1)*a(2)*...*a(n) - 1 are primes.at n=29A051956
- Index of first occurrence of n in A091853, or 0 if no such number exists.at n=23A091854
- Multiples of 11 containing an 11 in their decimal representation.at n=32A121031
- a(n) = 5*n^2 - 1.at n=46A134538
- Number of extreme n-breakable vectors.at n=24A141348
- a(n) = 2*4^n+4*3^n-2^n.at n=6A147535
- Numbers n with property that there is a different number m such that the lunar squares n*n and m*m are the same.at n=30A181319
- a(n) = 4*(5*n^2 - 5*n + 1).at n=23A193448
- Total sum of parts of multiplicity 10 in all partitions of n.at n=40A222738
- The Wiener index of the graph obtained by applying Mycielski's construction to the cycle graph C(n).at n=37A228320
- Number of 4 X n 0..2 arrays with no element equal to the sum of elements to its left or one plus the sum of the elements above it, modulo 3.at n=18A239031
- Number of (n+1)X(7+1) arrays of permutations of 0..n*8+7 with each element having directed index change 0,1 1,0 2,1 or -1,-1.at n=3A264475
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 1,0 2,1 or -1,-1.at n=48A264476
- Number of (4+1) X (n+1) arrays of permutations of 0..n*5+4 with each element having directed index change 0,1 1,0 2,1 or -1,-1.at n=6A264478
- Number of nX7 integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=2A266130
- T(n,k) = Number of n X k integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=38A266131
- Number of 3Xn integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=6A266133