11051
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11352
- Proper Divisor Sum (Aliquot Sum)
- 301
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10752
- Möbius Function
- 1
- Radical
- 11051
- 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
- yes
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 117
- 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
- a(n) = (2^n+1)*(2^n+2)/6.at n=8A007581
- Odd pentagonal numbers.at n=43A014632
- Number of periodic palindromic structures using a maximum of four different symbols.at n=17A056505
- a(n) = floor(n^4/64).at n=29A060494
- Smallest x > 0 such that gcd(2^x, A004086(2^x)) = 2^n.at n=11A072033
- a(n) is the smallest number such that gcd(a(n), sigma(a(n))) = n.at n=42A074391
- Numbers n such that RevBinary(RevDecimal(n))=RevDecimal(RevBinary(n)), where RevDecimal(n) is the decimal reversal of n (A004086) and RevBinary(n) is the binary reversal of n (A030101).at n=43A081433
- a(n) = 8*n^2 + 88*n + 43.at n=32A086760
- Number of subsets of {1, ..., n} that are double-free or sum-free.at n=16A088813
- Numerator of (1+1/n)^k - (1+k/n), 2<=k<=n, triangle read by rows.at n=39A099613
- Triangle of partial sums of Stirling numbers of 2nd kind (A008277): T(n,k) = Sum_{i=1..k} Stirling2(n,i), 1<=k<=n.at n=39A102661
- Positions where A109890(n) = Sum_{i = 1..n-1} A109890(i).at n=26A111315
- Pentagonal numbers (A000326) whose digit reversal is a semiprime (A001358).at n=24A115709
- Semiprimes k=p*q such that the polynomial (1+x)^k (mod k) has p+q nonzero terms.at n=36A116926
- Pentagonal numbers for which the product of the digits is also a pentagonal number.at n=39A117710
- Number of set partitions of length <= 4; sum of first 4 columns of triangle of Stirling numbers of 2nd kind; dimension of space of symmetric polynomials in 4 noncommuting variables.at n=9A124303
- Number of ways of placing non-attacking knights on an n X n chessboard symmetric under horizontal and vertical reflection.at n=10A129898
- Pentagonal numbers that are the sum of a nonzero pentagonal number and a nonzero square in at least one way.at n=31A134938
- Smallest number m such that prime(n) is a factor of both m and sigma(m).at n=13A156099
- Cyclops semiprimes.at n=38A160725