11961
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17760
- Proper Divisor Sum (Aliquot Sum)
- 5799
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7956
- Möbius Function
- 0
- Radical
- 1329
- Omega Function (Ω)
- 4
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Composite numbers whose prime factors contain no digits other than 3 and 4.at n=21A036314
- McKay-Thompson series of class 40A for Monster.at n=47A058662
- Convolution of sequence of primes with sequence sigma(n).at n=23A086718
- Triangular matrix T, read by rows, where row n equals row (n-1) of T^(n-1) after appending '1' for the main diagonal.at n=29A101479
- Column 1 of triangular matrix T=A101479, in which row n equals row (n-1) of T^(n-1) followed by '1'.at n=6A101482
- Triangle read by rows in which the binomial transform of the n-th row gives the Euler transform of the n-th diagonal of Pascal's triangle (A007318).at n=59A116672
- Partial sum of irregular primes A000928.at n=34A132360
- Square array, read by antidiagonals, where T(n,k) = T(n,k-1) + T(n-1,k+n-1) for n>0, k>0, such that T(n,0) = T(n-1,n-1) for n>0 with T(0,k)=1 for k>=0.at n=21A136730
- G.f. A(x) equals an infinite symmetric composition of functions x+x^n, n=2,3,4,...at n=9A163137
- a(n) = n^3/6 + 3*n^2/4 + 7*n/3 + 7/8 + (-1)^n/8.at n=40A173154
- Magnetic Tower of Hanoi, number of moves of disk number k, optimally solving the [NEUTRAL ; NEUTRAL ; NEUTRAL] pre-colored puzzle.at n=10A183117
- Number of ternary sequences which contain 000.at n=10A231430
- a(n) is the minimum number greater than a(n-1) such that the concatenation a(n) U a(n-1) U ... U a(1) is a Niven number, starting with a(1)=1.at n=45A239543
- 36-gonal numbers: a(n) = n*(17*n-16).at n=27A282853
- Number of nX4 0..1 arrays with every element unequal to 1, 2, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=11A305093
- Number of ON cells after n generations of two-dimensional automaton based on knight moves (see Comments for definition; here a cell is turned ON if 1 or 2 neighbors are ON).at n=37A322055
- Odd composite integers m such that A006497(3*m-J(m,13)) == 11*J(m,13) (mod m), where J(m,13) is the Jacobi symbol.at n=44A339725
- Odd composite integers m such that A006190(2*m-J(m,13)) == 1 (mod m), where J(m,13) is the Jacobi symbol.at n=46A340119
- Square array read by upward antidiagonals: T(n,k) is the number of n-ary strings of length k containing 000.at n=43A340242
- Numbers k such that A307437(k) is divisible by 3.at n=16A342037