11652
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 27216
- Proper Divisor Sum (Aliquot Sum)
- 15564
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3880
- Möbius Function
- 0
- Radical
- 5826
- 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
- 112
- 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 Dyck paths of knight moves.at n=14A005221
- Numbers k such that sigma(k) = sigma(k+8).at n=17A015876
- Numbers k such that 9*10^k - 11 is prime.at n=12A100275
- Number of columns of even length in all deco polyominoes of height n. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=6A121750
- Row sums of triangle A137710.at n=13A137711
- Elias omega coded prime numbers represented in decimal.at n=24A147764
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, 0), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)}.at n=6A151326
- a(n) = 81n^2 - n.at n=11A157953
- a(n) = 324n^2 - 2n.at n=5A158305
- a(n) = 144*n^2 - 12.at n=8A158543
- Number of ways to arrange 3 nonattacking queens on the lower triangle of an n X n board.at n=10A194493
- Number of nXnXn triangular 0..3 arrays with new values introduced in sequential zero-upwards order and exactly one 2x2x2 triangle having values all equal.at n=3A271071
- T(n,k)=Number of nXnXn triangular 0..k arrays with new values introduced in sequential zero-upwards order and exactly one 2x2x2 triangle having values all equal.at n=18A271075
- Numbers n such that n^1024 + (n+1)^1024 is prime.at n=20A274234
- Partial sums of A108754.at n=35A307673
- (1/8) * number of ways to select 3 distinct points forming a triangle of unsigned area = 1 from a square of grid points with side length n.at n=16A320544
- Numbers whose base phi representation is symmetrical with respect to the radix point.at n=38A330672
- Expansion of Product_{k>=1} 1/(1 - x^k * (1 + k*x)).at n=14A336976
- Numbers that are the sum of eight fourth powers in exactly six ways.at n=37A345838
- a(n) = coefficient of x^n in A(x) such that: 0 = Sum_{n=-oo..+oo} x^(2*n) * (x^n - 2*A(x))^(3*n+1).at n=5A358952