11861
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12300
- Proper Divisor Sum (Aliquot Sum)
- 439
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11424
- Möbius Function
- 1
- Radical
- 11861
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- 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
- Quadruples of different integers from [ 2,n ] with no global factor.at n=24A015627
- Numbers k such that the continued fraction for sqrt(k) has period 43.at n=32A020382
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 8.at n=22A031421
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 15.at n=14A051980
- a(n) is the least k such that (k*prime(n)#)^2 + 1, ((k+1)*prime(n)#)^2 + 1 and ((k+2)*prime(n)#)^2 + 1 are 3 primes, where prime(n)# is the n-th primorial.at n=23A098765
- a(n) is the smallest integer k such that the n-th (forward) difference of the partition sequence A000041 is positive from k onwards.at n=27A119712
- Positive numbers y such that y^2 is of the form x^2+(x+409)^2 with integer x.at n=7A160577
- a(n) = n*(14*n + 3).at n=29A195025
- Number of nX5 arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 nX5 array.at n=3A219378
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 nXk array.at n=31A219381
- Number of 4Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 4Xn array.at n=4A219384
- Rocket Sequence 34: a(0)=34, a(n) = A073846(a(n-1)).at n=37A261314
- Maximum starting value of X such that repeated replacement of X with X-ceiling(X/6) requires n steps to reach 0.at n=45A279076
- a(n) is the sum, over all overpartitions of n, of the overlined parts.at n=15A335666
- a(n) = Sum_{k=1..n} (-1)^(k+1) * floor(n/(2*k-1))^3.at n=22A350163