11382
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
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 26112
- Proper Divisor Sum (Aliquot Sum)
- 14730
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3240
- Möbius Function
- 1
- Radical
- 11382
- 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
- Largest number not the sum of distinct n-th-order polygonal numbers.at n=35A007419
- For any circular arrangement of 0..n-1, let S = sum of squares of every sum of two contiguous numbers; then a(n) = # of distinct values of S.at n=40A007773
- a(n) = n*(29*n + 1)/2.at n=28A022287
- Number of sums S of distinct positive integers satisfying S <= n.at n=41A026906
- Starting from generation 8 add previous and next term yielding generation 9.at n=13A048455
- Numbers which are the sum of their proper divisors containing the digit 9.at n=32A059468
- Number of pentagonal regions in regular n-gon with all diagonals drawn.at n=37A067152
- Starting positions of strings of three 9's in the decimal expansion of Pi.at n=9A083642
- a(n) = Sum_{i+j+k=n, 0<=i<=j<=k<=n} (2n)!/((i+j)! * (j+k)! * (k+i)!).at n=5A092473
- Indices of primes in the sequence defined by A(0) = 29, A(n) = 10*A(n-1) - 71 for n > 0.at n=7A101955
- a(n) = (n+1)(n+2)(n+3)(2n+3)(10n^2 + 27n + 20)/360.at n=6A108673
- a(n)=a(n-1)+sum of digits(a(n-1))*sum of digits(a(n-2)).at n=42A108720
- a(n) = n*(4*n^2 + 2*n + 1).at n=14A110451
- Next term is the sum of previous term and the square of the sum of its decimal digits, with a(0) = 10.at n=38A112787
- Numbers n such that n^6 + 545 is prime.at n=3A163592
- Number of binary strings of length n with no substrings equal to 0000, 0011, or 1011.at n=21A164429
- Irregular triangle T(n, k) = [x^k]( p(n, x) ), where p(n, x) = (1/x)*(1-x)^n*(1+x)^(n+2)*( Sum_{j >= 0} j^(n+1)*x^j ), read by rows.at n=39A165891
- Irregular triangle T(n, k) = [x^k]( p(n, x) ), where p(n, x) = (1/x)*(1-x)^n*(1+x)^(n+2)*( Sum_{j >= 0} j^(n+1)*x^j ), read by rows.at n=45A165891
- Number of nX5 0..4 arrays with each element equal to the number its horizontal and vertical zero neighbors.at n=7A197051
- The number of partitions of n which represent Chomp positions with Sprague-Grundy value 10.at n=54A284784