11076
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
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 28224
- Proper Divisor Sum (Aliquot Sum)
- 17148
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- 0
- Radical
- 5538
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 68
- 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 connected rooted strength 1 Eulerian graphs with n nodes.at n=8A007126
- a(n) = T(n,[ n/2 ]), where T is the array in A026300.at n=13A026307
- a(n) = n*(2*n^2 - 3*n + 4)/3.at n=26A037235
- Number of rooted trees with n nodes with every leaf at height 3.at n=23A048808
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 1.at n=15A049916
- a(n) = A088760(n+1)/A088760(n).at n=31A088761
- Number of partitions of n having positive odd rank (the rank of a partition is the largest part minus the number of parts).at n=41A101707
- A Chebyshev-related transform of the Jacobsthal numbers.at n=12A112577
- Number of ways the set {1,2,...,n} can be split into three subsets of which the sum of one is one more than the equal sums of both other subsets.at n=15A113038
- Numbers k such that k^4 contains a pandigital substring.at n=26A115934
- Let f(n) = exp(Pi*sqrt(n)); sequence gives numbers n such that f(n) - floor(f(n)) < 1/10^3.at n=15A127028
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 6 and 7.at n=31A136828
- G.f. satisfies: A(x) = 1 + x*A(x)^4/A(-x).at n=6A143341
- Eigentriangle, row sums = A001850, the Delannoy numbers.at n=39A152250
- 13 times pentagonal numbers: a(n) = 13*n*(3*n-1)/2.at n=24A153793
- Convolution of A007947 with itself.at n=46A175703
- Number of nX2 arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nX2 array.at n=8A219933
- Number of (n+3) X 10 0..1 matrices with each 4 X 4 subblock idempotent.at n=12A224567
- Numbers m such that the GCD of the x's that satisfy sigma(x) = m is 2.at n=32A241647
- Smallest integer m such that gcd{x | sum of proper divisors of x is m} is equal to 2*n, when there are at least two such x's.at n=14A253303