11065
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13284
- Proper Divisor Sum (Aliquot Sum)
- 2219
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8848
- Möbius Function
- 1
- Radical
- 11065
- 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
- yes
- 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
- Numbers that are the sum of 8 positive 7th powers.at n=36A003375
- Numbers k such that the continued fraction for sqrt(k) has period 55.at n=14A020394
- Number of distinct connected planar figures that can be formed from n non-overlapping diamonds.at n=6A056845
- Surround numbers of a length 2n zig-zag.at n=29A060641
- Numerators of constants arising in calculation of higher correlations of short divisor sums.at n=4A081174
- Numbers n such that (2^p + 1)/3 is prime, where p is the n-th prime.at n=32A123176
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having height k (1 <= k <= n).at n=40A129161
- Number of zero-sum -1..1 arrays of n elements with first through third differences also in -1..1.at n=28A202504
- Total number of distinct solvable subgroups of the symmetric group, counting conjugates as distinct.at n=7A218940
- Floor(M(g(n-1)+1,..,g(n))), where M = harmonic mean and g(n) = n(n + 1)(n + 2)/6.at n=39A227016
- Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 or 00000101.at n=9A259765
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 or 00000101.at n=45A259770
- Numbers k such that 94*10^k - 3 is prime.at n=23A276673
- Convolution square of A255528.at n=32A278710
- Numbers k such that k!6 - 48 is prime, where k!6 is the sextuple factorial number (A085158).at n=26A289701
- Partial sums of A304050.at n=43A304075
- Numbers m such that d(1)^0 + d(2)^1 + ... + d(k)^(k-1) = d(1)! + d(2)! + ... + d(k)!, where d(i), i=1..k, are the digits of m.at n=34A342944
- Squarefree semiprimes k such that k+1 is the product of three distinct primes and k+2 is the product of four distinct primes.at n=4A376352
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A384857.at n=49A384861