11053
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
- 12640
- Proper Divisor Sum (Aliquot Sum)
- 1587
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9468
- Möbius Function
- 1
- Radical
- 11053
- 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
- 42
- 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
- Convolution of natural numbers with (1, p(1), p(2), ... ), where p(k) is the k-th prime.at n=27A023538
- Number of partitions satisfying cn(2,5) <= cn(1,5) + cn(4,5) and cn(3,5) <= cn(1,5) + cn(4,5).at n=34A039891
- Number of trees with n nodes and 11 leaves.at n=6A055298
- Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; each k is an R(i(k),j(k)) and A057041(n)=j(F(n)), where F(n) is the n-th Fibonacci number.at n=43A057041
- Triangle T, read by rows, such that column 2k+1 of T equals column k of T^2 and column 2k of T equals column k of T*R: [T^2](n+k,k) = T(n+2k+1,2k+1) and [T*R](n+k,k) = T(n+2k,2k) for n>=0, k>=0, where R = SHIFT_RIGHT(T).at n=57A117418
- Column 2 of triangle A117418.at n=8A117420
- Triangle T, read by rows, formed by a column bisection of triangle A117418: column k of T equals column 2*k of A117418.at n=46A117425
- Cyclops semiprimes.at n=39A160725
- Sequence is obtained from Catalan numbers (A000108) by taking the factorial of each digit and adding them up.at n=16A165163
- 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=38A181319
- G.f. satisfies A(x) = (1 + x*A(x)^2) * (1 + x^2*A(x)^5).at n=7A200719
- Numbers n such that Q(sqrt(n)) has class number 7.at n=40A218039
- Fundamental discriminants of real quadratic number fields with class number 7.at n=28A218157
- Number of tilings of a 2 X n rectangle using integer-sided rectangular tiles of equal area.at n=20A220768
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=22A245208
- a(0) = 16, after which, if a(n-1) = product_{k >= 1} (p_k)^(c_k), then a(n) = (1/2) * (1 + product_{k >= 1} (p_{k+1})^(c_k)), where p_k indicates the k-th prime, A000040(k).at n=44A246344
- Number of compositions (ordered partitions) of n into prime parts such that no two adjacent parts are equal (Carlitz compositions).at n=35A301428
- Expansion of Product_{k>=1} (1 + (1 + x + x^2) * x^k).at n=28A309173
- a(n) = Sum_{i=1..n, gcd(i,n)=1} i*phi(i) where phi is Euler's totient function A000010.at n=43A333291
- Record high points in A336957.at n=48A337646