11631
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15512
- Proper Divisor Sum (Aliquot Sum)
- 3881
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7752
- Möbius Function
- 1
- Radical
- 11631
- 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
- 174
- 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
- no
- Odd
- yes
Appears in sequences
- T(n,n-3), array T as in A054120.at n=14A054121
- Numbers k such that x^k + x^4 + 1 is irreducible over GF(2).at n=13A057463
- Number of partitions of n such that the set of odd parts has only one element.at n=46A090868
- Total number of palindromic primes in base 4 with n digits.at n=16A117778
- The number of 1's in the n-th stage of A164349.at n=15A164363
- Number of n X 2 0..3 arrays with no element equal to two plus the sum of elements to its left or two plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=11A240333
- Number of (n+2)X(3+2) 0..1 arrays with no 3x3 subblock diagonal sum 2 and no antidiagonal sum 2 and no row sum 0 and no column sum 0.at n=5A255787
- Number of (n+2)X(6+2) 0..1 arrays with no 3x3 subblock diagonal sum 2 and no antidiagonal sum 2 and no row sum 0 and no column sum 0.at n=2A255790
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 2 and no antidiagonal sum 2 and no row sum 0 and no column sum 0.at n=30A255792
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 2 and no antidiagonal sum 2 and no row sum 0 and no column sum 0.at n=33A255792
- Preperiod (or threshold) of orbit of Watanabe's 3-shift tag system {00/1011} applied to the word (100)^n.at n=22A292090
- Sum of the odd parts in the partitions of n into 7 parts.at n=31A309624
- Number of alternately co-strong integer partitions of n.at n=39A317256
- Numbers k such that k, k + 1 and k + 2 are all norm-deficient in Gaussian integers (A332572).at n=38A332574
- G.f. satisfies A(x) = (1 + x) * (1 + x*A(x)^3).at n=6A364336
- Number of subsets of Z_n such that every ordered pair of distinct elements has a different sum.at n=20A382400
- Consecutive internal states of the linear congruential pseudo-random number generator (7141*s + 54773) mod 259200 when started at 1.at n=10A385463