11594
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 20736
- Proper Divisor Sum (Aliquot Sum)
- 9142
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 1
- Radical
- 11594
- Omega Function (Ω)
- 4
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = floor(binomial(n,4)/4).at n=34A011850
- Numbers whose sum of divisors is a fourth power.at n=26A019422
- Expansion of 1/Product_{m>=1} (1 - m*q^m)^17.at n=4A022741
- Truncated triangular pyramid numbers: a(n) = Sum_{k=9..n} (k*(k+1)/2 - 45).at n=33A051943
- a(n) = 10*n^2+n.at n=33A055437
- Positive numbers whose product of digits is 9 times their sum.at n=32A062041
- Jacobsthal(n)*Fibonacci(n-1).at n=10A093043
- a(n) = (p^2 - 1) / 12, where p is the n-th prime of the form 4*k+1.at n=34A109255
- Integers of the form (k+1)*(2k+1)/12.at n=43A164578
- Number of rhombuses on a (n+1)X9 grid.at n=33A190097
- Number of nX2 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to at least one horizontal or vertical neighbor.at n=8A199231
- T(n,k)=Number of nXk 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to at least one horizontal or vertical neighbor.at n=46A199237
- Multiples of 682.at n=17A200860
- The number of divisors d of n! such that d < A000793(n) (Landau's function g(n)) and the symmetric group S_n contains no elements of order d.at n=48A211391
- Starting from a(1)=1, a(n) is the minimum integer greater than a(n-1) such that a(n)+a(n-1), a(n)*a(n-1)+1 and a(n)*a(n-1)-1 are all primes.at n=45A228590
- The Szeged index of the n-sunlet graph (n>=3).at n=19A228600
- Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 2.at n=47A240011
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 126", based on the 5-celled von Neumann neighborhood.at n=32A270215
- Expansion of 2*x*(1 - 2*x)/(1 + 2*x - 8*x^2 - sqrt(1 - 4*x^2)).at n=10A305561
- a(n) = Product_{k=1..n, gcd(n,k) = 1} prime(k).at n=12A308260