8016
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 20832
- Proper Divisor Sum (Aliquot Sum)
- 12816
- 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
- 2656
- Möbius Function
- 0
- Radical
- 1002
- Omega Function (Ω)
- 6
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 114
- 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
- "BGK" (reversible, element, unlabeled) transform of 1,2,3,4,...at n=13A032063
- Numbers whose base-6 representation has exactly 6 runs.at n=15A043614
- Expansion of g.f. Product_{n>=1} (1-x^n)*(1-x^(5*n))/(1-x^(3*n))^2.at n=51A054274
- a(n+1) = a(n) converted to base 10 from base 12.at n=26A055983
- Summatory Pascal triangle T(n,k) (0 <= k <= n) read by rows. Top entry is 1. Each entry is the sum of the parallelogram above it.at n=49A059576
- Summatory Pascal triangle T(n,k) (0 <= k <= n) read by rows. Top entry is 1. Each entry is the sum of the parallelogram above it.at n=50A059576
- Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,3.at n=36A064238
- Positions of 9 in partition of decimal expansion of Pi A104807.at n=28A104809
- Positive numbers that are not the sum of two squares and a positive Fibonacci number.at n=22A115176
- Multiples of 16 containing a 16 in their decimal representation.at n=34A121036
- Indices of monotonically increasing primes which centrally enclose the prime sequence in A133781.at n=44A133782
- a(1) = 1, a(2) = 4, a(n+2) = 4*a(n+1) + (n + 1)*(n + 2)*a(n).at n=5A142984
- Numbers with distinct digits appearing in partition of decimal expansion of square root of 2. (A002193).at n=6A167834
- G.f. satisfies: A(A(x)) = Sum_{n>=1} A(x)^(n(n+1)/2)/x^(n(n-1)/2).at n=9A173437
- Number of ways of arranging the numbers 1 through n on a circle so that no sum of two adjacent numbers is prime, up to rotations and reflections.at n=10A182540
- Half the number of nX3 binary arrays with the number of 1-1 horizontal, vertical, diagonal and antidiagonal adjacencies equal to the number of 0-0 adjacencies.at n=5A183284
- Half the number of n X 6 binary arrays with the number of 1-1 horizontal, vertical, diagonal and antidiagonal adjacencies equal to the number of 0-0 adjacencies.at n=2A183287
- T(n,k) = Half the number of n X k binary arrays with the number of 1-1 horizontal, vertical, diagonal and antidiagonal adjacencies equal to the number of 0-0 adjacencies.at n=30A183289
- T(n,k) = Half the number of n X k binary arrays with the number of 1-1 horizontal, vertical, diagonal and antidiagonal adjacencies equal to the number of 0-0 adjacencies.at n=33A183289
- Arises in enumerating Huffman codes, compact trees, and sums of unit fractions.at n=15A194630