11543
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14112
- Proper Divisor Sum (Aliquot Sum)
- 2569
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9216
- Möbius Function
- -1
- Radical
- 11543
- 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
- 143
- 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
- Fibonacci sequence beginning 1, 30.at n=14A022400
- Bessel function Y_0(n) is a monotonically decreasing positive sequence.at n=24A046961
- Integers n > 10553 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10553.at n=0A063061
- Numbers n such that n+2*prime(n) is a perfect square.at n=31A104776
- One-seventh of the difference of squares of legs of primitive Pythagorean triangles, neither of which is a multiple of 7.at n=41A127924
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x + 97)^2 = y^2.at n=9A129836
- Composite numbers such that the square mean of their prime factors is a nonprime integer (where the prime factors are taken with multiplicity and the square mean of c and d is sqrt((c^2+d^2)/2)).at n=37A134602
- Composites that are the sum of two, three, four and five consecutive composite numbers.at n=17A151745
- Minimal exponents m such that the fractional part of (Pi-2)^m obtains a maximum (when starting with m=1).at n=13A153719
- Numbers k such that the fractional part of (Pi-2)^k is greater than 1-(1/k).at n=7A153720
- Positive numbers y such that y^2 is of the form x^2+(x+833)^2 with integer x.at n=31A156835
- Triangle of coefficients of g.f. a*(1+x)^n + b*(1-x)^(n+2)*polylog(-n-1, x)/x + 2^n*c*(1-x)^(n+1)*LerchPhi(x, -n, 1/2), with a = 65/2, b = -162/2, c = 135/2.at n=16A168525
- Triangle of coefficients of g.f. a*(1+x)^n + b*(1-x)^(n+2)*polylog(-n-1, x)/x + 2^n*c*(1-x)^(n+1)*LerchPhi(x, -n, 1/2), with a = 65/2, b = -162/2, c = 135/2.at n=19A168525
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210750; see the Formula section.at n=51A210749
- Numbers of the form ((6k+5)^2+9)/2 or 2(3k+4)^2-9.at n=49A214493
- Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 5 6 or 7.at n=4A252674
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 5 6 or 7.at n=25A252679
- Number of (5+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 5 6 or 7.at n=2A252684
- a(n) = (2^p+1)^(p-1) modulo p^2, where p is prime(n).at n=45A260531
- Numbers n such that n^1024 + (n+1)^1024 is prime.at n=19A274234