11562
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
- 16
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 12630
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3680
- Möbius Function
- 1
- Radical
- 11562
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 50
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n^2 + 2. Also coordination sequence for f.c.c. or A_3 or D_3 lattice.at n=34A005901
- a(0) = 1, a(n) = 40*n^2 + 2 for n>0.at n=17A010022
- The array described in A059513 read by antidiagonals in the 'up' direction.at n=29A059574
- The array described in A059513 read by antidiagonals in the direction of construction.at n=29A059575
- Column 1 of triangle A118032, where column 1 of the matrix square of A118032 forms a bisection of this sequence.at n=17A118034
- Triangle T, read by rows, equal to a diagonal bisection of A118032 such that diagonal n of T equals diagonal 2n+1 of A118032: T(n,k) = A118032(2n+1-k,k); also equals the matrix product of A118032 and SHIFT_UP(A118032).at n=46A118045
- Column 1 of triangle A118045; also equals a bisection of A118034, which is column 1 of A118032.at n=8A118047
- Numbers k for which 14*k+1, 14*k+5, 14*k+11 and 14*k+13 are primes.at n=38A123987
- Number of paths from (0,0) to (n+2,n) using only up and right steps and avoiding two or more consecutive moves up or three or more consecutive moves right.at n=40A177787
- Number of (n+1)X(2+1) 0..3 arrays x(i,j) with row sums sum{x(i,j), j=1..2+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=1A233352
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays x(i,j) with row sums sum{x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=4A233353
- Number of (2+1)X(n+1) 0..3 arrays x(i,j) with row sums sum{x(i,j), j=1..n+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..2+1} nondecreasing.at n=1A233355
- Root of the lower member A340700 of a pair of adjacent perfect powers, both with exponents > 2.at n=51A340702
- Numbers k such that 24*k-1 has at least three factors 7 and the partition function evaluated at k has at least the same number of factors 7 as 24*k-1.at n=14A340957
- Numbers n having some (possibly non-canonical) base-phi representation x.y, where y is the reverse of x.at n=43A362780
- Number of compositions of 7*n-2 into parts 6 and 7.at n=14A373934
- a(n) = 2*a(n-1) + 2*a(n-2) + 2*a(n-3) - a(n-4) with a(0)=0, a(1)=1, a(2)=2, a(3)=7.at n=10A389120
- a(n) = Sum_{k=0..floor(n/3)} binomial(k+1,2*n-6*k+1).at n=48A392490
- a(n) = Sum_{k=0..floor(n/2)} binomial(k+1,3*n-6*k+1).at n=32A392673