11950
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22320
- Proper Divisor Sum (Aliquot Sum)
- 10370
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4760
- Möbius Function
- 0
- Radical
- 2390
- 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
- Truncated tetrahedral numbers: a(n) = (1/6)*(n+1)*(23*n^2 + 19*n + 6).at n=14A005906
- Numbers k such that the continued fraction for sqrt(k) has period 96.at n=28A020435
- Multiplicity of highest weight (or singular) vectors associated with character chi_163 of Monster module.at n=39A034551
- Expansion of (1-x)/(1 - 2*x - x^4 + x^5).at n=14A052932
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 8 sites wide.at n=44A058365
- Numbers in base 10 that are palindromic in bases 3 and 4.at n=5A097928
- Expansion of x*(4-x)/( (2x-1)*(x^2-x-1)).at n=13A120461
- Numbers n such that 10^n - 51 is prime.at n=6A178429
- Number of n X n 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=4A207768
- Number of nX5 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=4A207771
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=40A207774
- Number of 5Xn 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=4A207775
- Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 1: bits 0-6 refer to segments from top to bottom, left to right.at n=24A234691
- Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x^2 + ... + x^n to the polynomial A_k*(x+3k)^k for 0 <= k <= n.at n=42A248977
- Number of length-n 0..4 arrays with no repeated value unequal to the previous repeated value plus one mod 4+1.at n=5A268940
- T(n,k)=Number of length-n 0..k arrays with no repeated value unequal to the previous repeated value plus one mod k+1.at n=41A268944
- Number of length-6 0..n arrays with no repeated value unequal to the previous repeated value plus one mod n+1.at n=3A268947
- Number of 6Xn 0..1 arrays with every element equal to 0, 2, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=8A303328
- Expansion of Product_{k=1..8} (1+x^(2*k-1))/(1-x^(2*k)).at n=50A316720
- Number of integer partitions of n such that every orderless pair of distinct parts has a different sum.at n=37A325857