11812
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 20678
- Proper Divisor Sum (Aliquot Sum)
- 8866
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5904
- Möbius Function
- 0
- Radical
- 5906
- Omega Function (Ω)
- 3
- 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
- 125
- 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
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=20A031830
- Number of partitions in parts not of the form 11k, 11k+3 or 11k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=41A035946
- Convolution of Pell(n) and 2^n.at n=10A094706
- Coefficients of the C-Rogers mod 14 identity.at n=42A105782
- Number of distinct lines passing through 3 or more points in an n X n grid.at n=23A225606
- Smallest integer m such that gcd{x | sum of proper divisors of x is m} is equal to 2*n, when there are at least two such x's.at n=15A253303
- a(n) = A000787(n) + 1.at n=44A259984
- Number of (n+2) X (3+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 00000101 or 00000111.at n=8A261706
- Triangle read by rows: T(n,k) (n>=1, 0<=k<n) is the number of permutations of n things that require k stack-sorts.at n=31A262494
- a(n) is the sum of the prime factors (with repetition) of the sum of the preceding terms; a(1)=a(2)=1.at n=47A268868
- a(n) is the sum of the prime factors, with repetition, of the sum of all preceding terms, with initial terms a(1)=1 and a(2)=2.at n=32A269004
- Maximal term of TRIP-Stern sequence of level n corresponding to permutation triple (e,13,23).at n=27A271486
- a(n) = 12*n^2 + 10*n - 30.at n=31A277982
- a(n) is obtained by applying the map k -> composite(k) n times, starting at n.at n=29A280327
- The number of trees with 4 nodes labeled by positive integers, where each tree's label sum is n.at n=45A301739
- Number of weakly unimodal compositions of n in which the greatest part occurs exactly eight times.at n=57A320319
- Number of square multiset partitions of integer partitions of n.at n=29A323531
- Numerator of (1+sigma(s)) / ((s+1)/2), where s is the square of n prime-shifted once (s = A003961(n)^2 = A003961(n^2)).at n=50A337338