11575
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 14384
- Proper Divisor Sum (Aliquot Sum)
- 2809
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9240
- Möbius Function
- 0
- Radical
- 2315
- Omega Function (Ω)
- 3
- 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
- 81
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 k such that the continued fraction for sqrt(k) has period 88.at n=30A020427
- Denominators of continued fraction convergents to sqrt(343).at n=9A041649
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 4,1,0,1,6,1,0 for x=0,1,2,3,4,5,6.at n=4A197565
- Number of isomorphism classes of nanocones with 3 pentagons and a symmetric boundary of length n.at n=46A197988
- The least number s having exactly n threes in the continued fraction of sqrt(s).at n=13A206583
- Expansion of Product_{k>=1} (1 - x^(12*k)) * (1 - x^(4*k-2)) / (1 - x^k).at n=47A280949
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + 2, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=36A294870
- Number of lone-child-avoiding rooted semi-identity trees with n vertices.at n=18A331966
- Number of vertices formed inside a right triangle by the straight line segments mutually connecting all vertices and points on the two shorter edges whose positions on one edge equal the Farey series of order n while on the other they divide its length into n equal segments.at n=8A359974
- Largest cost for a permutation problem.at n=32A367185
- Expansion of (1/x) * Series_Reversion( x * (1 - x^2 * (1 + x)) / (1 + x)^2 ).at n=7A387667