11276
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
- 6
- Divisor Sum
- 19740
- Proper Divisor Sum (Aliquot Sum)
- 8464
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5636
- Möbius Function
- 0
- Radical
- 5638
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 86
- 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
- Numbers whose base-4 representation contains exactly four 0's and two 3's.at n=31A045083
- Number of (unordered) ways of making change for n cents using coins of 1/2, 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage denominations up to 100 cents).at n=41A067997
- Interprimes which are of the form s*prime, s=4.at n=38A075279
- Sum of first n 5-almost primes.at n=37A086047
- Numbers n such that (sigma(n-2)+sigma(n+2))/2 = sigma(n).at n=32A099631
- Structured disdyakis dodecahedral numbers (vertex structure 5).at n=11A100163
- 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, 0), (1, 0, -1), (1, 0, 1), (1, 1, 0)}.at n=7A150755
- a(n) = n + (n-1)*2^(n-2).at n=11A188626
- Number of arrangements of n+1 nonzero numbers x(i) in -5..5 with the sum of trunc(x(i)/x(i+1)) equal to zero.at n=3A189541
- T(n,k)=Number of arrangements of n+1 nonzero numbers x(i) in -k..k with the sum of trunc(x(i)/x(i+1)) equal to zero.at n=31A189545
- Number of arrangements of 5 nonzero numbers x(i) in -n..n with the sum of trunc(x(i)/x(i+1)) equal to zero.at n=4A189548
- Number of compositions of n avoiding any 3-term arithmetic progression.at n=21A238569
- Number of partitions p of n such that (number of even numbers in p) <= 2*(number of odd numbers in p).at n=34A241642
- Signed recurrence over binary enriched p-trees: a(n) = (-1)^(n-1) + Sum_{x + y = n, 0 < x <= y < n} a(x) * a(y).at n=23A300865
- Numbers k such that k^2 reversed is a prime and k^2+(k^2 reversed) is a prime.at n=25A306301
- a(n) is the number of integer partitions of n for which the Kimberling index is equal to the index of the seaweed algebra formed by the integer partition paired with its weight.at n=53A318177
- G.f. satisfies A(x) = 1 + x*A(x)^2 / (1 - x*A(x))^4.at n=6A367234
- Number of partitions of n into prime power parts (including 1) not greater than sqrt(n).at n=54A369218
- G.f. A(x) satisfies 1 + 2*A(x) = Sum_{n>=0} (x + A(x)^n)^n.at n=9A380061