11060
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 26880
- Proper Divisor Sum (Aliquot Sum)
- 15820
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3744
- Möbius Function
- 0
- Radical
- 5530
- 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
- 130
- 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
- One-half the number of permutations of length n with exactly 4 rising or falling successions.at n=9A001268
- Coordination sequence for 4-dimensional I-centered cubic orthogonal lattice.at n=14A008532
- Triangle read by rows: T(n,k) is one-half the number of permutations of length n with exactly n-k rising or falling successions, for n >= 1, 1 <= k <= n. T(1,1) = 1 by convention.at n=40A010028
- a(n) = n*(n-1) + (n-2)*(n-3) + ... + 1*0 + 1 for n odd; otherwise, a(n) = n*(n-1) + (n-2)*(n-3) + ... + 2*1.at n=39A014112
- Numerators of continued fraction convergents to sqrt(88).at n=8A041156
- Numerators of continued fraction convergents to sqrt(792).at n=2A042526
- Number of directed multigraphs with loops on an infinite set of nodes containing a total of n arcs.at n=6A052171
- Numbers n such that n | sigma_13(n).at n=22A055717
- Number of primitive (period n) periodic palindromic structures using a maximum of five different symbols.at n=16A056516
- Sum of squares of first n quarter-squares (A002620).at n=15A059859
- Sum of terms of n-th group in A075383.at n=19A075386
- Numbers k such that A000984(k) mod k = 0 and A080383(k) != 7.at n=43A080392
- Triangle read by rows: S_D(n,k) = `Type D' Stirling numbers of the second kind.at n=30A086364
- Triangle read by rows: T(n,k) = one-half number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1. T(1,0) = 1 by convention.at n=40A086856
- 4-Smith numbers.at n=7A103125
- Numbers k such that f(k), f(k+1) and f(k+2) are all primes, where f(k) = 8*k^2 + 4*k + 1.at n=37A103777
- Group the triangular numbers so that the n-th group sum is a multiple of n. 1, (3, 6, 10, 15), (21), (28), (36, 45, 55, 66, 78), (91, 105, 120, 136, 153, 171, 190), ... Sequence contains the group sums.at n=13A114031
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 3 and 6.at n=49A136812
- a(n) = 9*n^2 + n.at n=34A154517
- a(n) = 1225*n^2 + 35.at n=3A158733