11899
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12136
- Proper Divisor Sum (Aliquot Sum)
- 237
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11664
- Möbius Function
- 1
- Radical
- 11899
- 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
- 143
- 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 82.at n=38A020421
- Sums of six consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2 + (n+5)^2.at n=42A027865
- Expansion of Sum_{n>=0} (q^n / Product_{k=1..n+5} (1 - q^k)).at n=29A035301
- Catafusenes (see reference for precise definition).at n=8A044048
- Numbers whose base-5 representation contains exactly two 0's and three 4's.at n=30A045213
- Coefficient of s(2n) in s(n,n) * s(n,n) * s(n,n) * s(n,n) * s(n,n), where s(2n) is the Schur function corresponding to the trivial representation, s(n,n) is a Schur function corresponding two the two row partition and * represents the inner or Kronecker product of symmetric functions.at n=11A082437
- a(1) = 932; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=31A105213
- Number of partitions of n with more odd parts than even parts.at n=35A108950
- Products of two primes that are not Chen primes.at n=34A115719
- a(n) = prime(n^2) - n^2.at n=39A141129
- Numbers k such that (7*10^(2k+1) - 18*10^k - 7)/9 is prime.at n=12A183180
- Numerator of h(n+5) - h(n) where h(n) = Sum_{k=1..n} (1/k) are the Harmonic numbers.at n=8A189998
- Half-convolution of sequence A000032 (Lucas) with itself.at n=15A201207
- Bisection of A099924 (Lucas convolution); one half of the terms with odd arguments.at n=7A203574
- Nonprime numbers with all divisors with additive digital root of 1.at n=33A211822
- Numerator of Sum_{i = Fibonacci(n-1)+1..Fibonacci(n)} 1/i.at n=6A218872
- Number of partitions p of n including round(mean(p)) as a part. (This is "Mathematica round").at n=37A241338
- Number of partitions p of n such that round(mean(p)) is a part of p; here, round(x) means floor(x + 1/2).at n=37A241733
- Least number k >= 0 such that (n!-k)/n is prime.at n=70A245696
- Terms in A247665 that are less than the previous term.at n=50A248389