11759
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12840
- Proper Divisor Sum (Aliquot Sum)
- 1081
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10680
- Möbius Function
- 1
- Radical
- 11759
- 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
- 81
- 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
- Number of monosubstituted alkanes C(n-1)H(2n-1)-X with n-1 carbon atoms that are not stereoisomers.at n=20A000621
- Numerators of continued fraction convergents to sqrt(283).at n=8A041532
- Pisot sequence L(5,6).at n=20A048583
- Pisot sequence L(6,8).at n=19A048586
- Smallest value of x such that M(x) = n, where M() is Mertens's function A002321.at n=35A051400
- Incrementally largest terms in the continued fraction for Khinchin's constant.at n=7A054866
- a(n) is the minimal area of a convex lattice polygon with 2n sides.at n=42A089187
- Least semiprime s for which the Mertens function M(s) = n.at n=39A123173
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1000-1111-0010 pattern in any orientation.at n=10A146400
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 1000-1111-0010 pattern in any orientation.at n=22A146402
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 1000-1111-0010 pattern in any orientation.at n=23A146402
- a(n) = 392*n - 1.at n=29A158004
- a(n) = 784*n - 1.at n=14A158399
- a(n) = 60*n^2 - 1.at n=13A158670
- a(n) = (2*n^3 + 5*n^2 - 9*n)/2.at n=21A162258
- a(n) = 3*A022004(n) + 8.at n=33A163635
- Numbers k such that k^k == -1 (mod phi(k)).at n=6A177012
- Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 2 ("abcdefg" scheme: bits represent segments in clockwise order).at n=29A234692
- Number of partitions p of n containing ceiling((min(p) + max(p))/2) as a part.at n=39A238484
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) > number of distinct parts of p.at n=38A241822