11063
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
- 8
- Divisor Sum
- 12768
- Proper Divisor Sum (Aliquot Sum)
- 1705
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9504
- Möbius Function
- -1
- Radical
- 11063
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- no
- 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 6 positive 7th powers.at n=26A003373
- Numbers k such that k*(k+4) is a palindrome.at n=17A028555
- For n>0, a(n) is the least quasi-Carmichael number to base -n, extended to n=0 with the least composite squarefree integer.at n=37A029591
- Number of partitions of n with equal number of parts congruent to each of 3 and 4 (mod 5).at n=42A035561
- Numbers whose base-5 representation contains exactly three 2's and three 3's.at n=13A045277
- Numbers n such that phi(phi(n)) + sigma(sigma(n)) - phi(sigma(n)) - sigma(phi(n)) = phi(n).at n=1A066945
- (Sum of composites among next n numbers)-(sum of primes among next n numbers).at n=30A094338
- a(n) = n*(8*n+3).at n=37A139276
- Number of planar n X n X n binary triangular grids symmetric both under 120 degree rotation and reflection with no more than 4 ones in any 4 X 4 X 4 subtriangle.at n=13A153934
- Numerator of Hermite(n, 23/24).at n=5A159998
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+2737)^2 = y^2.at n=31A201916
- a(n) = smallest k having at least three prime divisors d such that (d + n) | (k + n).at n=36A202158
- Least positive integer k such that 1 + 1/2 + ... + 1/k > n/phi, where phi = golden ratio = (1+sqrt(5))/2.at n=15A226160
- Number of length n 0..4 arrays with new values introduced in order from both ends, and least squares fitting to a straight line with slope zero, with a single point taken as having zero slope.at n=13A245847
- Sphenic numbers k such that floor(log(k)/log(lpf(k))) = 1+floor(log(k)/log(p)) for all primes p | k such that p > lpf(k), where lpf = A020639(k).at n=21A383177