11017
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 503
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10516
- Möbius Function
- 1
- Radical
- 11017
- 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
- 161
- 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) = Fibonacci(n+1) + prime(n).at n=19A004398
- Numbers k such that the continued fraction for sqrt(k) has period 88.at n=26A020427
- Generalized Catalan Numbers x^4*A(x)^2 -(1-x+x^4+x^5+x^6+x^7)*A(x) + 1 =0.at n=25A023430
- a(n) = 2*prime(n)^2 - prime(n+1)^2.at n=27A064051
- Numbers k such that 13k = 6j^2 + 6j + 1.at n=23A106390
- Numbers beginning with a vowel in French.at n=19A118557
- a(n) = 104*n + 9977.at n=10A126978
- a(n) = (n^3 + 3*n - 2)/2.at n=27A132127
- a(n) = prime(prime(n*n) - n*n) - n*n where prime(n) is the n-th prime.at n=15A141127
- Numerators of triangle T(n,k), n>=1, 0<=k<=n - 1, read by rows: T(n,k) is the coefficient of x^k in polynomial p_n for the n-th row sequence of A145153.at n=68A145140
- a(n) = 324*n + 1.at n=33A158272
- a(n) = 34*n^2 + 1.at n=18A158586
- Cyclops semiprimes.at n=28A160725
- Odd cyclops numbers.at n=48A162199
- a(n) = 15n^2 + 3n + 1.at n=26A165806
- Triangle of binomial sums read by rows: T(n,k) = sum(C(2n-2k-i,i) * C(2k-i,i), i=0..min(k,n-k)).at n=83A172991
- Triangle of binomial sums read by rows: T(n,k) = sum(C(2n-2k-i,i) * C(2k-i,i), i=0..min(k,n-k)).at n=85A172991
- The non-common part of the smaller number of an amicable pair.at n=19A180326
- Numbers n with property that there is a different number m such that the lunar squares n*n and m*m are the same.at n=6A181319
- Number of (n+2) X 6 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=15A190028