11963
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13680
- Proper Divisor Sum (Aliquot Sum)
- 1717
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10248
- Möbius Function
- 1
- Radical
- 11963
- 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
- 143
- 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
- Number of partitions of 3n into n parts from the set {0, 1, ..., 6} (repetitions admissible).at n=24A001977
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=11A045156
- Sum of composite numbers less than n-th prime.at n=39A079725
- Number of rooted trees with total weight n, where the weight of a node at height k is k (with the root considered to be at level 0).at n=32A117356
- Numbers k such that k and k^2 use only the digits 1, 3, 4, 6 and 9.at n=22A137027
- a(n) = 29 + 73*n + 37*n^2.at n=17A145980
- Number of nondecreasing arrangements of n numbers in -(n+6)..(n+6) with sum zero.at n=5A188210
- Number of nondecreasing arrangements of 6 numbers in -(n+4)..(n+4) with sum zero.at n=7A188213
- Molecular topological indices of the pan graphs.at n=27A192836
- Number of arrays of 4 nondecreasing integers in -n..n with sum zero and equal numbers greater than zero and less than zero.at n=40A203292
- Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of k-element subsets that can be chosen from {1,2,...,k*n} having element sum k*(k*n+1)/2.at n=71A204459
- Number of n-element subsets that can be chosen from {1,2,...,5*n} having element sum n*(5*n+1)/2.at n=6A204461
- Number of 6-element subsets that can be chosen from {1,2,...,6*n} having element sum 18*n+3.at n=5A204470
- Number of 3Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=8A241399
- Sum of all aliquot divisors of all positive integers <= prime(n).at n=43A244578
- Number of length 4 0..n arrays with each partial sum starting from the beginning no more than sqrt(3) standard deviations from its mean.at n=9A244943
- a(n) = (5/128)*n^4*(n mod 2) + (((-5/128)*n^4*(n mod 2) - 26) mod n) + n^3 (n > 0).at n=18A294264
- a(n) is the number which, when concatenated with A003226(n), the n-th automorphic number, gives (A003226(n))^2.at n=10A307104
- Number of uncrossed rooted knight's paths of length n on an infinite board.at n=5A323131
- One-half of the number of lines through at least 2 points of an n X n grid of points.at n=18A331780