11324
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21000
- Proper Divisor Sum (Aliquot Sum)
- 9676
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5328
- Möbius Function
- 0
- Radical
- 5662
- 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
- yes
- 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
- Powers of fifth root of 5 rounded down.at n=29A018126
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k=[ (n+1)/2 ], s = (natural numbers >= 2), t = (natural numbers >= 3).at n=47A024306
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor(n/2).at n=47A024868
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = floor( n/2 ), s = natural numbers >= 2, t = natural numbers >= 3.at n=46A024869
- [ exp(17/21)*n! ].at n=6A030842
- Positive numbers having the same set of digits in base 6 and base 10.at n=29A037437
- a(n) = smallest multiple of prime(n) such that a(n) +1 is a multiple of prime(n+1).at n=34A077338
- Numbers n such that p(3n) is prime, where p(n) is the number of partitions of n.at n=45A111389
- Number of bicyclic skeletons with n carbon atoms and the parameter 'alpha' having the value of 0. See the paper by Hendrickson and Parks for details.at n=7A125669
- a(n) = 2*n*(4*n-3).at n=38A139271
- 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, 0, 0), (0, -1, 0), (0, 1, -1), (1, 0, 1), (1, 1, -1)}.at n=8A149437
- Number of (n+1)X3 binary arrays with no 2X2 subblock commuting with any of its horizontal and vertical 2X2 subblock neighbors.at n=4A187722
- Number of (n+1)X6 binary arrays with no 2X2 subblock commuting with any of its horizontal and vertical 2X2 subblock neighbors.at n=1A187725
- T(n,k)=Number of (n+1)X(k+1) binary arrays with no 2X2 subblock commuting with any of its horizontal and vertical 2X2 subblock neighbors.at n=16A187729
- T(n,k)=Number of (n+1)X(k+1) binary arrays with no 2X2 subblock commuting with any of its horizontal and vertical 2X2 subblock neighbors.at n=19A187729
- a(0)=0, a(1)=6, a(n)=a(n-1)+a(n-2)-1.at n=18A187892
- Number of partitions of n+10 with largest inscribed rectangle having area <= n.at n=24A218631
- Number of n X 3 0..3 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=6A230905
- Number of nX7 0..3 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=2A230909
- T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=38A230910