11844
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 34944
- Proper Divisor Sum (Aliquot Sum)
- 23100
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3312
- Möbius Function
- 0
- Radical
- 1974
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits.at n=23A020342
- Fibonacci sequence beginning 0, 12.at n=16A022346
- Numbers k such that phi(x) = k has exactly 11 solutions.at n=41A060674
- Number of inequivalent (ordered) solutions to n^2 = sum of 8 squares of integers >= 0.at n=36A065462
- Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp(x*y)*log(1+x)/(1-x).at n=40A073480
- Square of lower triangular matrix of A056857 (successive equalities in set partitions of n).at n=50A078937
- Inverse binomial transform of squares of factorial numbers.at n=5A089041
- Number of compositions of n with exactly 1 adjacent equal pair of parts.at n=15A106357
- Multiples of 18 containing a 18 in their decimal representation.at n=28A121038
- a(0)=1, a(1)=1; for n>1, a(n) = the sum of the two largest earlier terms which are both coprime to n.at n=53A122456
- Triangle read by rows: T(n,k) is the number of paths in the right half-plane from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k H=(2,0) steps (0 <= k <= floor(n/2)).at n=45A132885
- A007318 * triangle M, where M = A002426 * 0^(n-k), 0<=k<=n.at n=51A135091
- Triangle of numbers of coincidence-free length n-m lists of m-tuples with all numbers 1,...,n-m in tuple position k, for k=1..m.at n=30A135814
- a(n+1) -+ a(n) = prime, a(n+1)*a(n) = average of twin prime pairs, a(1)=1, a(2)=6.at n=37A154494
- A117852*A130595 as lower triangular matrices.at n=48A171128
- Partial sums of A174928.at n=26A174929
- G.f.: 1 = Sum_{n>=0} a(n)*x^n * Sum_{k=0..n+1} C(n+1,k)^2*(-x)^k.at n=5A180716
- Expansion of q^(-5/24) * (eta(q^3) * eta(q^6))^3 / (eta(q) * eta(q^2))^4 in powers of q.at n=9A182031
- A192374(n)/2.at n=8A192375
- Triangle of coefficients of polynomials u(n,x) jointly generated with A208766; see the Formula section.at n=50A208765