11656
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23040
- Proper Divisor Sum (Aliquot Sum)
- 11384
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5520
- Möbius Function
- 0
- Radical
- 2914
- Omega Function (Ω)
- 5
- 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
- 37
- 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
- Number of n-step mappings with 4 inputs.at n=16A005945
- Trajectory of 1 under map n->45n+1 if n odd, n->n/2 if n even.at n=6A033978
- Numbers whose base-5 representation contains exactly three 1's and three 3's.at n=19A045247
- Starting from generation 6 add previous and next term yielding generation 7.at n=41A048453
- a(n) = floor(sqrt(Fibonacci(n+1)) - sqrt(Fibonacci(n))).at n=46A063595
- Indices of primes in sequence defined by A(0) = 63, A(n) = 10*A(n-1) + 13 for n > 0.at n=20A101528
- a(n) = lcm(A066840(n), A124440(n)).at n=49A124447
- a(n) = p(n+1)^2 + 2*p(n) + 1; p(n) is the n-th prime number and n >= 1.at n=26A155819
- Number of nondecreasing integer sequences of length 12 with sum zero and sum of absolute values 2n.at n=13A158146
- a(n) = 729*n^2 - 2*n.at n=3A158394
- Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and determinant n.at n=26A211140
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2<=x^2+y^2.at n=25A211634
- Number of (n+1) X (2+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2 X 2 subblock.at n=3A236049
- Number of (n+1)X(4+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2X2 subblock.at n=1A236051
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2X2 subblock.at n=11A236055
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the difference of the maximum and minimum in each 2X2 subblock.at n=13A236055
- a(n) = number of primes of the form k^n - m^k where k > m > 0.at n=41A242113
- E.g.f.: Sum_{n>=0} x^n / Product_{k=1..n} (k - x^k).at n=7A249479
- Numbers m such that m - 3 divides m^m + 3.at n=18A252041
- 27-gonal numbers: a(n) = n*(25*n-23)/2.at n=31A255186