11770
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23328
- Proper Divisor Sum (Aliquot Sum)
- 11558
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4240
- Möbius Function
- 1
- Radical
- 11770
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 174
- 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
- Expansion of (1+x)/(1-x-x^2-x^4-x^5).at n=16A014743
- Numbers k such that 201*2^k-1 is prime.at n=36A050852
- Number of 4-element intersecting families of an n-element set.at n=5A051181
- Smallest value of x such that M(x) = n, where M() is Mertens's function A002321.at n=39A051400
- a(n) = floor(n^m) where m = Sum_{k=1..n} (1/k).at n=15A067038
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,1,2}.at n=30A080000
- Convolution of Fibonacci(n) and 3^n.at n=9A094688
- Least m such that both p|m and p+2|m+2 for twin prime pairs (p,p+2) (p=A001359).at n=9A097972
- Maximum number of prime implicants of a symmetric function of n Boolean variables.at n=10A109385
- a(n) = prime(n)*(prime(n+1) + 1).at n=27A123134
- a(n) = A121265(n) - A121295(n).at n=11A127744
- 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, 1), (-1, 0, 1), (0, 1, 0), (1, 1, 0)}.at n=8A150056
- Triangle of coefficients of p(x,n) = (1/2)*(1-x)^(n+1)*Sum_{m >= 0} ((4*m+3)^n - (4*m+1)^n)*x^m, read by rows.at n=17A154854
- a(n) = 1331*n - 209.at n=8A157444
- a(n) = (7*n+2)*(7*n+5) = 49*n^2 + 49*n + 10.at n=15A177060
- Number of compositions of n avoiding three consecutive parts in arithmetic progression.at n=16A238423
- Number T(n,k) of triangle-free graphs on n unlabeled nodes with exactly k connected components; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=68A283417
- Numbers k such that 55*10^k + 7 is prime.at n=17A294376
- Rectangular array read by antidiagonals: a(m,n) = 2 * Integral_{t>=0} T_n((t+m)/2)*exp(-t)*dt, m>=0, n>=0, where T_n(x) is n-th Chebyshev polynomial of first kind.at n=51A300480
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=7A306048