11263
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
- 4
- Divisor Sum
- 12880
- Proper Divisor Sum (Aliquot Sum)
- 1617
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9648
- Möbius Function
- 1
- Radical
- 11263
- Omega Function (Ω)
- 2
- 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
- 205
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Sums of 12 distinct powers of 2.at n=14A038463
- a(n) = 11*2^n - 1.at n=10A086225
- Triangle T read by rows: T(n, 1) = 2*n + 1. For 1 < k <= n, T(n, k) = 2*T(n,k-1) + 1.at n=54A087322
- a(n) = (n+1) * 2^n - 1.at n=10A087323
- a(n) is the floor of the average of the 1st moment of all previous entries.at n=17A092483
- Triangle T read by rows: T(m,n) = number of convex polyominoes with an m+1 X n+1 minimal bounding rectangle, m > 0, n <= m.at n=12A093118
- a(n) = (7*n^3 + 6*n^2 + 5*n) / 6.at n=21A101165
- (1/8)*number of equilateral triangles that can be formed from the points of an (n+1)X(n+1)X(n+1) lattice cube.at n=9A103501
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 110-111-100 pattern in any orientation.at n=9A146183
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 110-111-100 pattern in any orientation.at n=20A146185
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 110-111-100 pattern in any orientation.at n=21A146185
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 10001-11111 pattern in any orientation.at n=15A147089
- a(n) = 512n - 1.at n=21A158011
- a(n) = 1024*n - 1.at n=10A158421
- a(n) = 44*n^2 - 1.at n=15A158628
- Number of reduced words of length n in the Weyl group D_8.at n=10A162211
- Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=15A192955
- a(n) = 11*4^n - 1.at n=5A198695
- Ordered differences of distinct numbers k*(2^(k-1)).at n=45A205120
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=25A245208