11072
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 14
- Divisor Sum
- 22098
- Proper Divisor Sum (Aliquot Sum)
- 11026
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5504
- Möbius Function
- 0
- Radical
- 346
- Omega Function (Ω)
- 7
- 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
- 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
- Coordination sequence for MgNi2, Position Ni3.at n=26A009934
- Expansion of (theta_3(z)*theta_3(15z) + theta_2(z)*theta_2(15z))^4.at n=22A028628
- Twice the positions in A051686 at which new primes appear in that sequence.at n=37A051861
- McKay-Thompson series of class 12e for Monster.at n=34A058493
- a(n) is the number of distinct (modulo geometric D3-operations) patterns which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.at n=15A060553
- Composite numbers k such that the sum of the proper divisors of k not including 1, (Chowla's function, A048050) and their product (A007956) are both perfect squares.at n=30A064180
- Number of unimodal compositions of n+2 where the maximal part appears exactly twice.at n=25A114921
- Number of partitions of n in which each part, with the possible exception of the largest, occurs at least twice.at n=44A116931
- Numerators of the continued fraction convergents of the decimal concatenation of the odd natural numbers.at n=10A128839
- Number of ways to toss a coin n times and not get a run of five.at n=14A135492
- Triangle of coefficients of the polynomials (1 - x)^n*A(n,x/(1 - x)), where A(n,x) are the Eulerian polynomials of A008292.at n=44A141720
- Number of peaks at height >= 2 in all dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0) steps at positive heights).at n=15A191309
- Number of n-bead necklaces labeled with numbers 1..4 allowing reversal, with no adjacent beads differing by more than 1.at n=12A208717
- Triangle read by rows, T(n,k) = sum_{j=0..n} (-1)^(n+k+j) A(n,j)*C(j,n-k), A(n,j) the Eulerian numbers; n >= 0, k >= 0.at n=49A225678
- Expansion of (phi(x) / f(-x^4))^2 in powers of x where phi(), f() are Ramanujan theta functions.at n=45A227033
- Write n in binary and interpret as a decimal number; a(n) is this quantity minus n.at n=28A228071
- Write n in binary and interpret as a decimal number; a(n) is this quantity minus n.at n=29A228071
- Number of nX2 0..1 arrays with every element equal to 1, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=10A298448
- a(1) = 1; a(n+1) = Sum_{d|n} sigma(n/d)*a(d), where sigma = sum of divisors (A000203).at n=31A307817
- Numbers missing from A317415.at n=5A317417