11436
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 26712
- Proper Divisor Sum (Aliquot Sum)
- 15276
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3808
- Möbius Function
- 0
- Radical
- 5718
- 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
- 81
- 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
- Coordination sequence for hexagonal close-packing.at n=33A007899
- Coordination sequence for alpha-Nd, Position Nd1.at n=33A009948
- Number of positive numbers m such that A073642(m) = n.at n=54A087135
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 101-111-010 pattern in any orientation.at n=15A146220
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 0), (0, -1), (1, -1), (1, 1)}.at n=10A151428
- G.f.: Sum_{n>=0} x^n * (1+x)^A003188(n), where A003188(n) = n XOR [n/2] is the Gray code for n.at n=19A227526
- Number of length 4 0..n arrays with each partial sum starting from the beginning no more than one standard deviation from its mean.at n=12A244792
- Number of length n+5 0..3 arrays with no three disjoint pairs in any consecutive six terms having the same sum.at n=1A248443
- T(n,k)=Number of length n+5 0..k arrays with no three disjoint pairs in any consecutive six terms having the same sum.at n=7A248448
- Number of length 2+5 0..n arrays with no three disjoint pairs in any consecutive six terms having the same sum.at n=2A248450
- Positive even numbers which are neither of the form p + 2^m + 1 nor of the form p + 2^m - 1 with p prime.at n=13A270446
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 259", based on the 5-celled von Neumann neighborhood.at n=53A271054
- Number of integer partitions of n whose distinct parts are connected.at n=54A304716
- Regular triangle read by rows where T(n,k) is the number of labeled connected graphs with loops with n edges and k vertices, 1 <= k <= n+1.at n=26A322147
- Total number of nodes summed over all nonnegative lattice paths from (0,0) to (n,0) such that slopes of adjacent steps differ by at most one, assuming zero slope before and after the paths.at n=11A333680
- Number of ways to choose a strict composition of each part of an integer partition of n.at n=15A336141
- Number of connected labeled graphs with n edges and n vertices and with loops allowed.at n=6A368951
- Irregular triangle read by rows where T(n,k) is the number of labeled connected loop-graphs covering n vertices with k edges.at n=47A369195
- a(n) is the largest number t such that there exist numbers i,j,k such that, for all m <= t, there exist integers x,y,z with x*i + y*j + z*k = m and |x|+|y|+|z| <= n.at n=30A383579