11496
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 28800
- Proper Divisor Sum (Aliquot Sum)
- 17304
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3824
- Möbius Function
- 0
- Radical
- 2874
- 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
- 55
- 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
- a(n) = Sum_{k=0..n} binomial(3*k,k)*binomial(3*n-3*k,n-k).at n=5A006256
- Number of 5-tuples of different integers from [ 1,n ] with no global factor.at n=18A015640
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (primes).at n=31A024867
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...).at n=25A025099
- Consider the trajectory of n under the iteration of a map which sends x to 3x - sigma(x) if this is >= 0; otherwise the iteration stops. The sequence gives values of n which eventually reach 0.at n=20A037159
- E.g.f. A(x) satisfies A(x) = exp(x*A(x)/(1 - x*A(x))).at n=5A052873
- Number of points in N^7 of norm <= n.at n=5A055406
- Number of points in N^n of norm <= 5.at n=7A055420
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,7.at n=13A064240
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,15.at n=30A064244
- Values of n such that N=(an+1)(bn+1)(cn+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,35.at n=6A064254
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A071667/A071668.at n=14A089878
- Number of partitions of n into parts but with two kinds of parts of sizes 1 to 8.at n=18A103927
- Triangle read by rows: T(n,k) (k>=0) is the number of RNA secondary structures of size n (i.e., with n nodes) having k arcs that are covered by other arcs.at n=53A110317
- Total number of palindromic primes in base 6 with n digits.at n=12A117782
- Apparently an erroneous version of A007827.at n=11A129859
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 1, 1), (0, 0, -1), (1, 0, 0)}.at n=10A148237
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (0, 0, -1), (0, 1, 1), (1, 0, 1), (1, 1, -1)}.at n=7A150732
- a(1)=1, a(2)=2, a(n)=a(n-1)+floor(a(n-2)*a(n-1)/(a(n-2)+a(n-1))).at n=28A173090
- Smallest number k such that k^n is the sum of numbers in a twin prime pair.at n=34A195336