11995
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14400
- Proper Divisor Sum (Aliquot Sum)
- 2405
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9592
- Möbius Function
- 1
- Radical
- 11995
- 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
- 187
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 100.at n=29A020439
- Number of true prime powers whose binary order, ceiling(log_2(p^x)), is n.at n=37A036380
- Number of isomers of alkyl homologs of adamantane with n carbon atoms.at n=7A036996
- Number of n-node graphs containing a 4-cycle.at n=8A039751
- Numbers whose base-5 representation contains exactly two 0's and three 4's.at n=32A045213
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,0,2}.at n=35A080001
- A new general triangle sequence based on the Eulerian form in three parts ( subtraction):m=1; t0(n,k)=If[n*k == 0, 1, Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]] t(n,k,m)=If[n == 0, 1, ( m*(n - k) + 1)*t0(n - 1 + 1, k - 1) + (m*k + 1)*t0(n - 1 + 1, k) - m*k*(n - k)*t0(n - 2 + 1, k - 1)].at n=31A157179
- A new general triangle sequence based on the Eulerian form in three parts ( subtraction):m=1; t0(n,k)=If[n*k == 0, 1, Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]] t(n,k,m)=If[n == 0, 1, ( m*(n - k) + 1)*t0(n - 1 + 1, k - 1) + (m*k + 1)*t0(n - 1 + 1, k) - m*k*(n - k)*t0(n - 2 + 1, k - 1)].at n=32A157179
- G.f.: q-sinh(x) evaluated at q=-x.at n=37A198202
- Number of 4 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 4 X n array.at n=39A220034
- Semiprimes sp of the form p^2 + q + 1 where p and q are consecutive primes.at n=13A242243
- Numbers whose sum of divisors is equal to the product of the number of divisors of their k first powers, for some k.at n=28A283758
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 3 or 5 king-move adjacent elements, with upper left element zero.at n=8A303966
- a(n) is the smallest integer k > 1 such that k cannot be expressed as a sum of distinct earlier terms nor is a multiple of any earlier term.at n=16A330070
- Composite terms in A330070.at n=4A330126
- a(n)^2 is the start of the first occurrence of n consecutive perfect powers, all of which are squares with exponents equal to 2 (A111245).at n=34A340663
- Antidiagonal sums of A382310.at n=33A382311
- Rectangular array read by antidiagonals, T(n,k) is the number of labeled digraphs on [n] along with a (coloring) function c:[n] -> [k] such that for all u,v in [n], u->v implies u<=v and c(u)<=c(v), n>=0, k>=0.at n=50A382363