11376
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 32240
- Proper Divisor Sum (Aliquot Sum)
- 20864
- 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
- 474
- Omega Function (Ω)
- 7
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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
- Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(4,11).at n=8A019495
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=28A024600
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=35A025001
- Number of rooted trees with n nodes with every leaf at height 4.at n=20A048809
- 20-gonal (or icosagonal) numbers: a(n) = n*(9*n-8).at n=36A051872
- Numbers k such that sigma(x) = k has exactly 10 solutions.at n=17A060666
- Positive numbers whose product of digits is 7 times their sum.at n=25A062384
- Diagonal sums of number triangle A112292.at n=6A112294
- A090801(2n-1)+A090801(2n).at n=29A140958
- a(n) = A000010(n) * A002088(n).at n=38A143231
- Zero followed by partial sums of A008865.at n=32A145067
- a(n) = 3600*n^2 - 1601*n + 178.at n=1A157853
- Number of binary strings of length n with equal numbers of 00001 and 00011 substrings.at n=14A164193
- Composite numbers k such that k = (product of divisors of k) mod (sum of divisors of k).at n=38A187712
- Number of nondecreasing arrangements of n numbers in -n..n with sum zero and not more than two numbers equal.at n=7A188229
- T(n,k)=Number of nondecreasing arrangements of n numbers in -(n+k-2)..(n+k-2) with sum zero and not more than two numbers equal.at n=43A188236
- Number of nondecreasing arrangements of 8 numbers in -(n+6)..(n+6) with sum zero and not more than two numbers equal.at n=1A188241
- Number of 2 X 2 X 2 triangular 0..n arrays with some element plus some adjacent element totaling n+1 or n-1 exactly once.at n=44A270607
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 601", based on the 5-celled von Neumann neighborhood.at n=6A272373
- Numbers n such that n*prime(n) is a pandigital number containing digits 0-9 exactly once.at n=0A272552