11896
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22320
- Proper Divisor Sum (Aliquot Sum)
- 10424
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5944
- Möbius Function
- 0
- Radical
- 2974
- Omega Function (Ω)
- 4
- 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
- 99
- 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
- yes
- Odd
- no
Appears in sequences
- Number of triples of different integers from [ 2,n ] with no global factor.at n=44A015618
- Number of parts in all partitions of n into distinct parts.at n=45A015723
- Numbers k such that the continued fraction for sqrt(k) has period 88.at n=32A020427
- Sum of squares of first n positive integers congruent to 1 mod 3.at n=15A024215
- a(n) = |{m : multiplicative order of 6 mod m=n}|.at n=55A059888
- Numbers n such that n*359# +-1 are twin primes, where 359# = 72nd primorial (A002110(72)).at n=13A087907
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=46A090495
- a(n) = 8*n^2 - 7*n + 1.at n=39A125201
- Sequence h_n arising in enumeration of arrays of directed blocks (see Quaintance reference for precise definition).at n=12A129874
- Partial sums of floor(n^2/3) (A000212).at n=47A181286
- Number of 6-step one space leftwards or up, two space rightwards or down asymmetric rook's tours on an n X n board summed over all starting positions.at n=6A187301
- Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=17A192981
- Numbers n such that gcd(n, phi(n)) = gcd(phi(n), sigma(n)) = gcd(sigma(n), n) = tau(n).at n=23A217301
- Numbers n such that n^8 + 1 and (n + 2)^8 + 1 are both prime.at n=30A217972
- The sum of denominators of unreduced mediants in Farey sequences of orders 1,2,..,n.at n=20A248832
- Number of tilings of an n X 1 rectangle by tiles of dimension 1 X 1 and 2 X 1 such that every tile shares an equal-length edge with a tile of the same size.at n=31A248880
- Integers n such that n!/(n-2) + 1 is prime.at n=28A271376
- Triangle read by rows: T(n,k) = number of configurations of k nonattacking bishops on the black squares of an n X n chessboard (0 <= k <= n - [n>1]).at n=44A274105
- p-INVERT of (1,1,1,1,1,...), where p(S) = (1 - S)*(1 - 2*S)*(1 - 3*S).at n=5A291002
- Numbers k such that 5*10^k + 41 is prime.at n=18A291605