11948
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21840
- Proper Divisor Sum (Aliquot Sum)
- 9892
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5712
- Möbius Function
- 0
- Radical
- 5974
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- 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
- Numerators of continued fraction convergents to sqrt(649).at n=7A042246
- Binomial transform of A061800.at n=11A086954
- a(n) = Sum_{k=0..floor(n/4)} C(n-3*k,k+1).at n=28A098578
- Row sums of number triangle A114278.at n=13A114279
- a(n) = gcd(a(n-1),n-1)*a(n-1) + d(n-1) if a(n-1) is not divisible by 2, otherwise a(n) = a(n-1)/2, where gcd denotes common divisor, d(n) is number of divisors of n.at n=49A133904
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 4.at n=26A209988
- a(n) is the rational part of A(n) = (6-sqrt(7))*A(n-1) - (12-4*sqrt(7))*A(n-2) + (8-3*sqrt(7))*A(n-3) with A(0)=3, A(1)=6-sqrt(7), A(2)=19-4*sqrt(7).at n=7A215817
- Number of (n+2) X (4+2) 0..1 arrays with no 3 X 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 0 or 3 and no column sum 0 or 3.at n=16A258962
- Number of nX3 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two exactly once.at n=5A268793
- Number of nX6 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two exactly once.at n=2A268796
- T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two exactly once.at n=30A268798
- T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two exactly once.at n=33A268798
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 694", based on the 5-celled von Neumann neighborhood.at n=27A273411
- a(n) has exactly (a(n) - n) / 2 partitions with exactly (a(n) - n) / 2 prime parts.at n=28A299732
- Exponents k where A000120(3^k) - A070939(3^k)/2 reaches a new minimum.at n=33A372097