11653
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11968
- Proper Divisor Sum (Aliquot Sum)
- 315
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11340
- Möbius Function
- 1
- Radical
- 11653
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 112
- 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
- Numbers k for which 10k+1, 10k+3, 10k+7 and 10k+9 are primes.at n=39A007811
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=86A013583
- Least k such that first k terms of A022300 contain n more 2's than 1's.at n=12A025515
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 56 ones.at n=28A031824
- Counterbalanced numbers: Composite numbers k such that phi(k)/(sigma(k)-k) is an integer.at n=17A055940
- Numbers n such that sum of squares of even digits of n equals sum of squares of odd digits of n.at n=9A076164
- Products of two primes that are not Chen primes.at n=32A115719
- Triangle read by rows of operator ordering coefficients corresponding to the Hermite polynomials H_n(x).at n=23A225695
- Triangle read by rows of operator ordering coefficients corresponding to the Hermite polynomials H_n(x).at n=25A225695
- Poincaré series for hyperbolic reflection group with Coxeter diagram o-(5)-o---o-(5)-o.at n=18A265048
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 209", based on the 5-celled von Neumann neighborhood.at n=25A270893
- Expansion of Sum_{i>=1} mu(i)^2*x^i/(1 - x^i) / Product_{j>=1} (1 - x^j), where mu() is the Moebius function (A008683).at n=23A281573
- a(n) = A337339(n) - n.at n=51A337341
- Odd numbers k such that sigma(k) + sigma(k+2) > 2*sigma(k+1); odd terms in A053228.at n=25A358395
- a(n) = smallest k such that li(k) - pi(k) >= n, where li(k) is the logarithmic integral and pi(x) is the number of primes <= x.at n=24A359145
- a(n) = Sum_{d|n} (-1)^(n/d-1) * binomial(d+3,4).at n=21A366814
- Numbers that can be written in exactly two different ways as s_1^x_1 + ... + s_t^x_t, with 1 < s_1 < ... < s_t and {s_1,..., s_t} = {x_1,..., x_t} for some t > 0.at n=28A386966