11145
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17856
- Proper Divisor Sum (Aliquot Sum)
- 6711
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5936
- Möbius Function
- -1
- Radical
- 11145
- 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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Square root of A030681.at n=25A030682
- Numbers having four 3's in base 6.at n=27A043384
- McKay-Thompson series of class 10D for the Monster group.at n=10A058100
- a(1)=9; a(n)=floor((47+sum(a(1) to a(n-1)))/5).at n=39A120177
- McKay-Thompson series of class 10D for the Monster group with a(0) = 6.at n=10A132130
- 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=(1,0) steps (0<=k<=n).at n=57A132884
- Numbers k such that 5^k mod 2^k is prime.at n=27A178996
- Values x for records of the minima of the positive distance d between the ninth power of a positive integer x and the square of an integer y such that d = x^9 - y^2 (x <> k^2 and y <> k^9).at n=22A179791
- Numbers n such that sigma(n^3) is the sum of two positive cubes.at n=30A281364
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2)*b(n-1)*b(n), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=9A296279
- Triangle read by rows: T(n,k) is the number of set partitions of {1..3n} into n sets of 3 with k disjoint strings of adjacent sets, each being a contiguous set of elements.at n=17A334060
- E.g.f.: 1 / (1 - x * exp(3*x)).at n=5A336951
- a(n) = 1 + Sum_{k=0..n-5} binomial(n-4,k) * a(k).at n=15A344492
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..n} (k * (n-j))^j/j!.at n=41A351790
- Expansion of e.g.f. sin( 2 * (exp(x) - 1) )/2.at n=8A357738
- Index where prime(n) appears as a term in A379248.at n=37A379290
- Triangle read by rows: T(n,k) = Sum_{i=k..n} C(i-1,i-k)*C(i,k).at n=62A382225
- Truncated centered square numbers: a(n) = 14*n^2 - 22*n + 9.at n=28A389928