11500
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 26208
- Proper Divisor Sum (Aliquot Sum)
- 14708
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4400
- Möbius Function
- 0
- Radical
- 230
- Omega Function (Ω)
- 6
- 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
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Apply partial sum operator thrice to primes.at n=16A014150
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=31A025104
- Expansion of x^2*(2 - x + x^2) / ((1 + x)*(1 - x)^4).at n=39A026035
- Thickened pyramidal numbers: a(n) = 2*(n+1)*n + Sum_{i=1..n} (4*i*(i-1) + 1).at n=20A050533
- McKay-Thompson series of class 20b for Monster.at n=21A058557
- Reversion of y - y^2 - y^3 + y^5.at n=9A063029
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 89 ).at n=35A063362
- Number of n-digit base-12 deletable primes.at n=4A096245
- Repeatedly convert from sexagesimal to centesimal, starting with 60.at n=11A097714
- Row sums of triangle A134480.at n=23A134481
- a(1)=1, a(n)=a(n-1)+n^0 if n odd, a(n)=a(n-1)+ n^2 if n is even.at n=39A135301
- Number of (2+1) X (n+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..n+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..2+1} nondecreasing.at n=10A233302
- Number of n X 5 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest, modulo 3.at n=25A239358
- Triangle read by rows: the reversed x = 1+q Narayana triangle at m=3.at n=24A243663
- Irregular triangle read by rows: T(n,k) (n >= 1, 0 <= k <= n^2) = number of n X n (0,1) real matrices with k zeros and permanent zero.at n=42A260043
- Expansion of Product_{k=1..9} (1+x^(2*k-1))/(1-x^(2*k)).at n=48A316721
- Expansion of Product_{k>=0} (1 + x^(5^k))^(5^(k+1)).at n=16A321357
- Expansion of Product_{k>=0} (1 + x^(5^k))^(5^(k+1)).at n=19A321357
- Number of SAWs crossing a triangular domain of the hexagonal lattice.at n=4A356613
- Integers k such that 2^k contains all powers of 2 not exceeding k as substrings.at n=31A372680