11098
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 6182
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5340
- Möbius Function
- -1
- Radical
- 11098
- 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
- 68
- 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
- Number of two-rowed partitions of length 3.at n=38A001993
- Number of primes <= 7^n.at n=6A055732
- a(n) = 15*n^2 + 6*n + 1.at n=27A080861
- a(n) = round( (sqrt n)^(sqrt n) ).at n=29A094054
- a(n) = floor(sqrt(n)^sqrt(n)).at n=29A094092
- Numbers n for which there are exactly six k such that n = k + (product of nonzero digits of k).at n=4A096927
- Second row of array in A101385.at n=16A101644
- Expansion of 1/(1-x^2(1-3x)).at n=20A106855
- Number of partitions of n such that the largest part is a multiple of the smallest part.at n=33A117086
- Related to numbers of equicolorable trees (see Pippenger article for definition).at n=10A119854
- Number of lines through at least 2 points of a 10 X n grid of points.at n=22A160850
- Number of binary strings of length n with no substrings equal to 0000 0010 or 1010.at n=13A164422
- Irregular triangle T(n, k) = [x^k]( p(n, x) ), where p(n, x) = (1-x)^(2*n+3)*( Sum_{j >= 0} (2*j+ 1)^n*x^j )*( Sum_{j >= 0} j^(n+1)*x^j ), read by rows.at n=19A165883
- Irregular triangle T(n, k) = [x^k]( p(n, x) ), where p(n, x) = (1-x)^(2*n+3)*( Sum_{j >= 0} (2*j+ 1)^n*x^j )*( Sum_{j >= 0} j^(n+1)*x^j ), read by rows.at n=21A165883
- Number of 0..2 arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo 3.at n=12A200662
- Number of partitions of 2n in which every part is <n; also, the number of partitions of 2 into rational numbers a/b such that 0<a<b<=n and b divides n.at n=16A209815
- Number of partitions of n in which all parts are less than n/2.at n=34A210249
- Sum of numerators of Farey Sequence of order n.at n=46A213544
- Number of partitions of n into parts <= phi(n), where phi is Euler's totient function (cf. A000010).at n=34A227296
- Duplicate of A210249.at n=33A233771