11977
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14400
- Proper Divisor Sum (Aliquot Sum)
- 2423
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9744
- Möbius Function
- -1
- Radical
- 11977
- 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
- 187
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k that divide s(k), where s(1)=1, s(j)=7*s(j-1)+j.at n=45A014854
- Numbers k such that k | 6^k + 1.at n=11A015953
- Numbers k such that k | 13^k + 1.at n=25A015963
- Incorrect version of A091967.at n=20A031135
- Incorrect version of A107357.at n=20A037181
- Numbers k such that k^3 divides 6^(k^2) + 1.at n=4A128680
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 1000-1000-1111-0010 pattern in any orientation.at n=10A147114
- Numbers k such that k^3 divides 13^(k^2) + 1.at n=3A177813
- Number of (n+4)X6 binary arrays with every 1 having exactly three king-move neighbors equal to 1 but with no 2X2 blocks of 1s.at n=8A183459
- T(n,k)=Number of (n+4)X(k+4) binary arrays with every 1 having exactly three king-move neighbors equal to 1 but with no 2X2 blocks of 1s.at n=46A183465
- T(n,k)=Number of (n+4)X(k+4) binary arrays with every 1 having exactly three king-move neighbors equal to 1 but with no 2X2 blocks of 1s.at n=53A183465
- Number of (n+1) X 8 binary arrays with every 2 X 2 subblock commuting with each of its horizontal and vertical 2 X 2 subblock neighbors.at n=9A186460
- Expansion of (1-x)/(1-x^6-3*x^5-4*x^4-3*x^3-2*x^2-2*x).at n=9A190214
- G.f. A(x) satisfies 1 = Sum_{n>=0} (-x)^(n^2) * A(x)^(n+1).at n=10A193114
- a(n) = 7*n*(2*n + 1).at n=29A195026
- Conjecturally, the largest k such that prime(n)^2 is the largest squared prime divisor of binomial(2k,k).at n=30A239623
- Numbers k such that k^2 divides 6^k + 1.at n=4A292332
- Numbers k such that k^2 divides 13^k + 1.at n=3A292338
- G.f. satisfies: A(x) = Sum_{n>=0} x^n * (1 + x*A(x)^(n-1))^n.at n=10A300041
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 3, 7 or 8 king-move adjacent elements, with upper left element zero.at n=5A316515