11874
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23760
- Proper Divisor Sum (Aliquot Sum)
- 11886
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3956
- Möbius Function
- -1
- Radical
- 11874
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = a(n-1) + a(round(2*(n-1)/3)) + a(round((n-1)/3)) with a(1)=1, a(2)=2.at n=33A033500
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5) <= cn(1,5).at n=63A036854
- Numbers which are the sum of their proper divisors containing the digit 9.at n=35A059468
- Triangle read by rows: T(n,k) is number of Motzkin paths of length n having k peaks at height 1.at n=58A097611
- Numbers m such that pi(m) = prime(d_1*d_2*...*d_k) where d_1 d_2 ... d_k is the decimal expansion of m.at n=8A107120
- a(n) = 625*n - 1.at n=18A158374
- Sums of three consecutive numbers each of which is the product of two distinct primes and each of which has no exponent greater than one for either of its two prime factors.at n=41A173969
- Number of n X 6 0..2 arrays with exactly floor((n X 6)/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=1A223102
- T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=22A223104
- Number of 2Xn 0..2 arrays with exactly floor(2Xn/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=5A223105
- Number of length n+6 0..2 arrays with no seven consecutive terms having four times the sum of any three elements equal to three times the sum of the remaining four.at n=2A249191
- T(n,k)=Number of length n+6 0..k arrays with no seven consecutive terms having four times the sum of any three elements equal to three times the sum of the remaining four.at n=8A249197
- Number of length 3+6 0..n arrays with no seven consecutive terms having four times the sum of any three elements equal to three times the sum of the remaining four.at n=1A249200
- T(n,k)=Number of length n+6 0..k arrays with no seven consecutive terms having five times the sum of any two elements equal to two times the sum of the remaining five.at n=8A249212
- Number of length 3+6 0..n arrays with no seven consecutive terms having five times the sum of any two elements equal to two times the sum of the remaining five.at n=1A249215
- T(n,k)=Number of length n+6 0..k arrays with no seven consecutive terms having six times any element equal to the sum of the remaining six.at n=8A249319
- Number of length 3+6 0..n arrays with no seven consecutive terms having six times any element equal to the sum of the remaining six.at n=1A249322
- Numbers k such that (25*10^k - 37) / 3 is prime.at n=23A276698
- From solution to a certain functional equation.at n=4A282046
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + 2*b(n-1) - b(n-2) - 2, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=16A294426