8046
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 18000
- Proper Divisor Sum (Aliquot Sum)
- 9954
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2664
- Möbius Function
- 0
- Radical
- 894
- Omega Function (Ω)
- 5
- 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
- 44
- 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
- a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=3 and a(2)=a(3)=1.at n=10A024737
- a(n) = [ 2nd elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=31A025193
- Number of partitions of n into parts not of the form 17k, 17k+5 or 17k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=34A035966
- Numbers n such that 65*2^n-1 is prime.at n=25A050558
- Least k such that k*7^n +/- 1 are twin primes.at n=45A064217
- Convolution of triangular numbers with partition numbers.at n=14A086716
- Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=0, k=-2 and l=0.at n=9A177110
- Triangle read by rows: Pascal's triangle (A007318) times the Fibonacci triangle (A139375).at n=37A201165
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random 0..1 n X 2 array.at n=11A218078
- Number of unrooted binary leaf-multi-labeled trees with n leaves on the label set [2].at n=10A220826
- Number of (n+1)X(3+1) 0..1 arrays with the difference of the upper and lower median value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise.at n=2A235568
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the difference of the upper and lower median value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise.at n=12A235573
- Numbers n such that floor( n^(3/2) ) is a concatenation of two successive numbers.at n=9A244289
- Number of length n 0..2 arrays with no pair in any consecutive three terms totalling exactly 2.at n=21A245989
- Number of n X 3 0..1 arrays with no element unequal to a strict majority of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=14A280228
- Expansion of r(q)^3 / r(q^3) in powers of q where r() is the Rogers-Ramanujan continued fraction.at n=37A285628
- Number of Motzkin trees that are "uniquely closable skeletons".at n=19A300126
- Number of free pure symmetric identity multifunctions with one atom and n positions.at n=17A317878
- 2*a(n) is the start of 3 consecutive numbers (even-odd-even) that are sums of divisors, i.e., terms of A000203.at n=30A342555
- a(n) = Sum_{k=0..n} binomial(n,k)^2 * Stirling2(2*k,k) * Stirling2(2*n-2*k,n-k).at n=4A384471