8116
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 14210
- Proper Divisor Sum (Aliquot Sum)
- 6094
- 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
- 4056
- Möbius Function
- 0
- Radical
- 4058
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 39
- 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 k such that 145*2^k+1 is prime.at n=17A032422
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5) <= cn(1,5).at n=61A036854
- Open 3-dimensional ball numbers (version 3): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2,1/2,0).at n=25A053595
- Number of log-concave compositions (ordered partitions) of n.at n=40A069916
- Numbers n such that in the 3 X 3 square arrangement of the 9 primes p(n),..,p(n+8), totals of 3 rows and 3 columns, are all prime.at n=1A115050
- Concatenation of first two digits and last two digits of n-th even perfect number.at n=25A138875
- Numbers x such that 0 < |x^10 - y^7| < x^(53/7) for some number y.at n=2A173371
- a(n) = Sum_{d|n} A007955(d) where A007955(m) = product of divisors of m.at n=19A175317
- Numbers k such that (7*10^(2*k+1)+18*10^k-7)/9 is prime.at n=10A183183
- Number of length 2+3 0..n arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth.at n=14A248539
- 10-step Fibonacci sequence starting with 0,0,0,0,0,0,1,0,0,0.at n=23A251761
- Number of length n 1..(7+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7.at n=4A258630
- T(n,k)=Number of length n 1..(k+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7.at n=59A258631
- Number of length 5 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7.at n=6A258636
- We represent square arrays of single-digit entries by the single number formed by reading them row-by-row, top-to-bottom. Sequence gives list of k X k square grids formed from single-digit numbers having property that reading across each row and each column gives a square number.at n=6A260305
- Number of terms of height n in Recamán's sequence A005132.at n=15A269830
- Numbers that are the largest value in the Collatz (3x+1) trajectories of exactly six initial values.at n=29A274467
- Expansion of Sum_{i>=1} x^(i*(i+1)/2)/(1 - x^(i*(i+1)/2)) / Product_{j>=1} (1 - x^(j*(j+1)/2)).at n=50A281615
- Sum of binomial(Y(2,p), 2) over the partitions p of n, where Y(2,p) is the number of part sizes with multiplicity 2 or greater in p.at n=25A304825
- Number of (2n+1) X (2n+1) black-and-white mirror-symmetric grids that are legal for crossword puzzles and have no all-black edges.at n=4A325409