11524
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20944
- Proper Divisor Sum (Aliquot Sum)
- 9420
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5544
- Möbius Function
- 0
- Radical
- 5762
- 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
- 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
- Number of atoms in a decahedron with n shells.at n=24A004068
- a(n) = Sum_{k=0..2*n} (k+1)*T(n,k), T given by A027960.at n=8A027981
- a(1)=1, a(2)=2, a(3)=3; for n >= 3, a(n) is smallest number such that all a(i) for 1 <= i <= n are distinct, all a(i)+a(j) for 1 <= i < j <= n are distinct and all a(i)+a(j)+a(k) for 1 <= i < j < k <= n are distinct.at n=22A036241
- Positive numbers having the same set of digits in base 7 and base 10.at n=31A037440
- Numbers k such that 47*2^k-1 is prime.at n=11A050549
- a(n+1) = a(n) converted to base 10 from base 13.at n=19A055984
- a(n) = (n^3 + 5*n + 18)/6.at n=43A060163
- a(n) = a(n-1) + a(n-2) + R(a(n-3)) where a(0) = a(1) = a(2) = 1 and R(n) (A004086) means the reverse of n.at n=15A074858
- Sum of largest parts of all partitions of n into odd parts.at n=37A092322
- Numbers k that divide 5^k + 3.at n=5A123052
- Start with a(1)=1; for n >= 1, a(n+1)=a(n)+a(k) with k=[n - n-th digit of sqrt(2)]. If k<0 or k=0, then a(k)=0.at n=34A133393
- Triangle T_3(n, m), the number of surjective multi-valued functions from {1, 1, 1, 2, 3, ..., n-2} to {1, 2, 3, ..., m} by rows (n >= 1, 1 <= m <= n).at n=31A172107
- Number of numerical semigroups of multiplicity n and genus n+2.at n=41A180739
- Number of subsets of {1..n} (including empty set) such that the pairwise GCDs of elements are not distinct.at n=25A196720
- Number of distinct values taken by 4th derivative of x^x^...^x (with n x's and parentheses inserted in all possible ways) at x=1.at n=40A199205
- The number of divisors d of n! such that d < A000793(n) (Landau's function g(n)) and the symmetric group S_n contains no elements of order d.at n=49A211391
- Number of arrangements of n nonattacking Queens on an n X n board, with no Queens on both main diagonals.at n=13A225740
- Numbers of espalier polycubes of a given volume in dimension 4.at n=23A229917
- Number of length n+1 0..2*6 arrays with the sum of the absolute values of adjacent differences equal to n*6.at n=3A249980
- T(n,k) is the number of length n+1 0..2*k arrays with the sum of the absolute values of adjacent differences equal to n*k.at n=39A249982