11195
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13440
- Proper Divisor Sum (Aliquot Sum)
- 2245
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8952
- Möbius Function
- 1
- Radical
- 11195
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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
- Expansion of 1/((1-x^2)*(1-x^4)^2*(1-x^6)*(1-x^8)*(1-x^10)) (even powers only).at n=42A001994
- Denominators of continued fraction convergents to sqrt(956).at n=10A042851
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=5A045156
- Rhombi (in 3 different orientations) in a rhombus with 60-degree acute angles.at n=29A052153
- Nearest integer to 1/(Sum_{k>=n} 1/k^4).at n=15A083559
- Triangle read by rows: T(n,k) is the number of permutations of [n] with exactly k increasing runs of even length.at n=21A097592
- Largest terms a(n) forming a self-convolution of an integer sequence (A132832) such that: a(n) <= 2*a(n-1) for n>0 with a(0)=1.at n=14A132831
- a(n) is the number of central ideals of a garland of order 2n, i.e., a(n) = g(2n,n), where g(n,k) is the number of ideals of size k in a garland (or double fence) of order n (see A137278).at n=13A136029
- Derived from the centered polygonal numbers: start with the first triangular number, then the sum of the first square number and the second triangular number, then the sum of first pentagonal number, the second square number and the third triangular number, and so on and so on...at n=20A141534
- Joint-rank array of odd prime powers: p(i+1)^j, i>=1, j>=1, read by antidiagonals.at n=30A182870
- Number of distinct values of the sum of a*b+a*c+b*c over 2 sets of three a,b,c 0..n integers.at n=44A225269
- Number T(n,k) of compositions of n into k parts with distinct multiplicities, where parts are counted without multiplicities; triangle T(n,k), n>=0, 0<=k<=max{i:A000292(i)<=n}, read by rows.at n=52A242896
- Number of compositions of n into exactly three different parts with distinct multiplicities.at n=6A246230
- Number of reducible integer partitions of n.at n=33A305563
- Number of permutations of [n] with exactly one increasing run of even length.at n=6A317281
- Expansion of e.g.f. exp(exp(x)*BesselI(1,2*x)/x - 1).at n=7A323672
- Lexicographically earliest sequence of distinct positive integers such that for any n > 0, a(n) and a(n+1) are congruent modulo the n-th prime number, and the least value not yet in the sequence appears as soon as possible.at n=35A367290
- Number of (binary) heaps of length n whose element set equals {1,2,3}.at n=10A376962
- First differences of A379290.at n=57A379296