11974
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17964
- Proper Divisor Sum (Aliquot Sum)
- 5990
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5986
- Möbius Function
- 1
- Radical
- 11974
- 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
- 50
- 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
- yes
- Odd
- no
Appears in sequences
- Number of factorization patterns of polynomials of degree n over F_3.at n=21A006168
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 84 ones.at n=4A031852
- Offsets for the Atkin Partition Congruence theorem.at n=42A036492
- Denominators of continued fraction convergents to sqrt(916).at n=10A042771
- Least j such that 6*p(j)*M(n)-1 is prime with p(j)=j-th prime and M(n) = Mersenne prime.at n=25A157333
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 35", based on the 5-celled von Neumann neighborhood.at n=25A269816
- a(n) = coefficient of x^n, n >= 0, in A(x) such that: 2 = Sum_{n=-oo..+oo} x^(2*n) * (1 - x^n)^(2*n) * A(x)^n.at n=12A357546
- a(n) = 8*n^2 - 5*n + 1.at n=39A383464