11604
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 27104
- Proper Divisor Sum (Aliquot Sum)
- 15500
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3864
- Möbius Function
- 0
- Radical
- 5802
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 24
- 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
- Earliest monotonic sequence fixed (apart from signs) under reversion.at n=11A007303
- a(n) = Sum_{k=0..n} A026626(n, k).at n=13A026633
- Cube root of A030697.at n=24A030698
- Numbers whose base-7 representation contains exactly four 5's.at n=4A043416
- Triangular array giving number of labeled digraphs on n unisolated nodes and k=0..n*(n-1) arcs.at n=29A054547
- a(k) = card { i*j, i <= k, j <= lcm(1,2,3...,k) }.at n=8A101459
- a(n) is the number k such that 2^(2k+1)-1 = A000668(n+1).at n=24A146768
- Number of permutations p on the set [n] with the properties that abs(p(i)-i) <= 3 for all i and p(1) <= 2.at n=10A188494
- Number of n X 2 0..1 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=41A201347
- Number of (w,x,y) with all terms in {0,...,n} and the numbers w,x,y,|w-x|,|x-y| distinct.at n=25A213490
- Number of partitions of n+9 with largest inscribed rectangle having area <= n.at n=25A218630
- Smallest number k such that exactly half the numbers in [1..k] are prime(n)-smooth.at n=45A290154
- Number of permutations of [n] avoiding {4231, 1324, 1234}.at n=10A294763
- Numbers missing from A317416.at n=32A317418
- Expansion of Product_{i>=2, j>=2} (1 + x^(i*j))^j.at n=32A326831
- Array read by antidiagonals: T(n,k) (n>=1, k>=1) = number of ways to select four points from an n X k grid so that three of them form a triangle of nonzero area and the extra point is strictly inside the triangle.at n=60A334709
- Number of ways to select four points from an n X n grid so that three of them form a triangle of nonzero area and the extra point is strictly inside the triangle.at n=5A334712
- a(n) is the number of regions formed by n-secting the angles of a hexagon.at n=39A335733
- Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] without consecutive adjacent values.at n=60A338526
- Consider a square drawn on the perimeter of a square lattice with side length n. a(n) is the number of regions inside the square after drawing unit circles centered at each interior lattice point of the square.at n=41A339623