11574
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25116
- Proper Divisor Sum (Aliquot Sum)
- 13542
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3852
- Möbius Function
- 0
- Radical
- 3858
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 81
- 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
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/31).at n=26A011941
- a(n) is the smallest number that is the sum of 3 nonzero squares in exactly n ways.at n=44A025414
- Square array read by antidiagonals: T(n,k)=T(n,k-1)*n^2/(n-1)-Catalan(k-1) with a(n,1)=n-1 and a(1,k)=0 where Catalan(k)=C(2k,k)/(k+1)=A000108(k).at n=39A067346
- Expansion of (1+sqrt(1-4x))/(4sqrt(1-4x)-2).at n=6A104530
- Powers of 10 seconds, expressed as days, hours, minutes, seconds.at n=25A115097
- Smallest positive integer which can be expressed as the ordered sum of 3 squares in exactly n different ways.at n=45A124970
- Number of (n+1) X (2+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).at n=1A234445
- T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).at n=4A234450
- Number of n X n 0..1 arrays with the number of 1's horizontally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=3A285145
- Number of n X 4 0..1 arrays with the number of 1's horizontally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=3A285148
- T(n,k) = Number of n X k 0..1 arrays with the number of 1s horizontally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=24A285152
- Number of 4 X n 0..1 arrays with the number of 1's horizontally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=3A285155
- Expansion of Product_{k>=0} (1 + x^(3^k) + x^(2*3^k) + x^(3^(k+1)))^(3^k).at n=42A309046
- Expansion of (chi(x^3) / chi(-x^2))^2 in powers of x where chi() is a Ramanujan theta function.at n=46A328789
- a(n) = 1 + Sum_{k=2..n} (-1)^k * k^2 * a(floor(n/k)).at n=32A361983
- G.f. satisfies A(x) = Sum_{n>=0} x^n * abs(1/A(x)^n), where abs(F(x)) equals the series expansion formed by the unsigned coefficients in F(x).at n=15A383377
- The number of different shuffle square roots of the prefix of length 2n of the infinte word 00110011001100...at n=25A384728