11344
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 22010
- Proper Divisor Sum (Aliquot Sum)
- 10666
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5664
- Möbius Function
- 0
- Radical
- 1418
- Omega Function (Ω)
- 5
- 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
- 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
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (odd natural numbers).at n=23A025083
- a(n) = n^5 - (n-1)^5 + (n-2)^5 - ... +(-1)^n*0^5.at n=7A062393
- a(n) = floor(( (n+1)/2 )^n) - n!.at n=7A127610
- Difference between 2^n and the largest factorial <= 2^n.at n=14A135996
- Binomial transform of [1, 3, 7, 0, 0, 0, ...].at n=57A140063
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 1, -1), (1, 0, -1), (1, 0, 1)}.at n=8A149358
- Number of 5 X 5 arrays of squares of integers, symmetric about main diagonal, with all rows summing to n.at n=43A156385
- Convergent of an infinite product, a*b*c,...; a = [1,1,1,...], b = [1,0,2,0,2,0,2,...], c = [1,0,0,3,0,0,3,0,0,3,...],...at n=17A162506
- Sum of digits of square is sum of square of digits.at n=30A165550
- Monotonic ordering of set S generated by these rules: if x and y are in S then x^2+y^2-xy is in S, and 2 is in S.at n=11A192533
- Alternating sums of powers of 1,2,...,7.at n=5A198630
- Number of n X 3 0..2 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=34A201272
- Number of nX5 arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns.at n=2A221606
- T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns.at n=23A221609
- Number of 3 X n arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns.at n=4A221611
- Number of distinct values of the sum of i^2 over 8 realizations of i in 0..n.at n=38A225275
- Number of composites removed in each step of the Sieve of Eratosthenes for 10^7.at n=26A227155
- Number of compositions of n into distinct parts with exactly eight descents.at n=16A241727
- Concatenation of n-th prime and n-th nonprime.at n=29A253910
- G.f.: Product_{k>=1} (1 + 2*x^(k^2)) / (1-x^k).at n=25A280224