11510
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
- 8
- Divisor Sum
- 20736
- Proper Divisor Sum (Aliquot Sum)
- 9226
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4600
- Möbius Function
- -1
- Radical
- 11510
- Omega Function (Ω)
- 3
- 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
- yes
- 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
- yes
- 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 meanders in which first bridge is 3.at n=12A006660
- Numbers whose sum of divisors is a fourth power.at n=25A019422
- Numbers k such that k | sigma_6(k) + phi(k)^6.at n=15A055700
- Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 8064.at n=12A077096
- a(n) = n * Sum_{d|n} binomial(n,d)/gcd(n,d).at n=14A105862
- Smallest k such that k*2*p(n)^2+1=q is prime, k*2*q^2+1=r, k*2*r^2+1=s, k*2*r^2+1=t, r, s, and t are also prime.at n=22A224496
- Sum of squares of cycle lengths for different cycles in Fibonacci-like sequences modulo n.at n=21A233246
- Least positive integer k such that sigma(k) and phi(k*n) are both squares, where sigma(k) is the sum of all positive divisors of k, and phi(.) is Euler's totient function.at n=46A259916
- Irregular triangle read by rows: T(n,k) = number of meanders with n bridges in which the first bridge is bridge k.at n=57A259974
- Irregular triangle read by rows: T(n,k) = number of meanders with n bridges in which the first bridge is bridge k.at n=62A259974
- Numbers missing from A317415.at n=26A317417
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A317560
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=2A317562
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=23A317565
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=25A317565
- a(n) is the number of regions formed by n-secting the angles of a pentagon.at n=43A335553
- Numbers k such that w(k-2), w(k-1), and w(k) are all odd, where w is A336957.at n=4A338070
- Sum of the positions of maximum parts in all compositions of n.at n=12A377823
- Triangle read by rows: T(n,k) is the number of open meanders with 2n crossings and k exterior top arches, 0 <= k <= n.at n=29A380369