11726
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21168
- Proper Divisor Sum (Aliquot Sum)
- 9442
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 1
- Radical
- 11726
- 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
- 130
- 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
- Octahedral numbers: a(n) = n*(2*n^2 + 1)/3.at n=26A005900
- a(n) = Sum{T(i,j)}, 0<=i<=n, 0<=j<=n, T given by A026681.at n=11A026690
- Positive numbers having the same set of digits in base 8 and base 10.at n=39A037442
- A simple context-free grammar: convolution square of A049140.at n=10A052708
- Numbers k that, when expressed in base 5 and then interpreted in base 9, give a multiple of k.at n=27A062931
- Sum(j=1,n,floor(A000041(j)/j)).at n=43A086736
- Defining sequence for an inverse Fredholm-Rueppel triangle.at n=24A104977
- Number of primes between the successive central binomial coefficients; i.e., the number of primes in the interval (C(2n,n), C(2n+2,n+1)], with inclusion on the right.at n=9A117758
- Sum of the squares of the quadratic residues of prime(n).at n=12A125613
- a(n) = 1 + (9960 + (6804 + (2464 + (735 + (175 + (21 + n)*n)*n)*n)*n)*n)*n/5040.at n=10A145129
- Number of permutations of 1..n that almost avoid 231.at n=8A174195
- a(1) = 1; a(2*n) = prime(n)*a(n), a(2*n+1) = prime(n)*a(n) + a(n+1), where prime(n) is the n-th prime.at n=25A176716
- Number of 3X3 0..n arrays with each 2X2 subblock determinant nonzero and the array of 2X2 subblock determinants symmetric under 90 degree rotation.at n=8A187529
- Number of 0..n arrays x(0..4) of 5 elements with zero 3rd differences.at n=44A200083
- Integers nearest to (2^((n-3)/2) + 3^((n-3)/2)).at n=20A229194
- Number of partitions p of n such that median(p) <= multiplicity(max(p)).at n=40A240208
- a(n) = n*(n + 1)*(n + 2)*(4*n - 3)/6.at n=11A264851
- Sum of terms in level n of TRIP - Stern sequence associated with permutation triple (e,12,12).at n=8A278614
- 38-gonal numbers: a(n) = n*(18*n-17).at n=26A282850
- Suspected divisor-or-multiple permutation of squarefree numbers: a(n) = A019565(A304533(n)).at n=40A304537