8047
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8680
- Proper Divisor Sum (Aliquot Sum)
- 633
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7416
- Möbius Function
- 1
- Radical
- 8047
- Omega Function (Ω)
- 2
- 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
- 44
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of n-node unlabeled graphs without endpoints (i.e., no nodes of degree 1).at n=8A004110
- 7th-order maximal independent sets in cycle graph.at n=59A007389
- Base 9 digits are, in order, the first n terms of the periodic sequence with initial period 1,2,0,3.at n=4A037693
- Numbers having four 1's in base 6.at n=34A043376
- Smallest composite that when added to sum of prime factors reaches a prime after n iterations.at n=28A050710
- Heights of peaks of more than 8000 meters (as of Sep 25 2001), in decreasing order.at n=11A064296
- a(n) = the number of occurrences of 1 in all compositions of n without 2's = # of occurrences of the integer k in compositions of n+k-1 without 2's (k > 2).at n=14A079662
- Antidiagonal sums of square array A082011 divided by the number of the antidiagonal.at n=44A082015
- Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.at n=4A084276
- Values of k such that floor(k*tanh(Pi)) = floor((k+1) tanh(Pi)).at n=29A096613
- Diagonal sums of triangle A099573.at n=26A099574
- Expansion of x*(1+2*x)/(1+x+x^2-2*x^3).at n=22A103749
- Number of partitions of n which represent first player winning Chomp positions.at n=32A112471
- Start with 1 and repeatedly reverse the digits and add 73 to get the next term.at n=18A118221
- Place n points on each of the three sides of a triangle, 3n points in all; a(n) = number of nondegenerate triangles that can be constructed using these points (plus the 3 original vertices) as vertices.at n=11A130748
- 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, 1), (1, 0, -1), (1, 1, -1), (1, 1, 0)}.at n=8A149000
- Convolution of A007947 with itself.at n=44A175703
- a(n) = maximum(continuedfraction(F(n+1)^n/F(n)^n)) - L(n) + (1-(-1)^n)/2, where F(n) is Fibonacci(n) and L(n) is the n-th Lucas number.at n=11A213358
- Number of Motzkin paths of length n with no level steps at height 2.at n=12A252354
- Numbers k with the property that it is possible to write the base 2 expansion of k as concat(a_2,b_2), with a_2>0 and b_2>0 such that, converting a_2 and b_2 to base 10 as a and b, we have sigma(a + b) = sigma(k).at n=9A258843