7108
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
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12446
- Proper Divisor Sum (Aliquot Sum)
- 5338
- 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
- 3552
- Möbius Function
- 0
- Radical
- 3554
- 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
- 119
- 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(1)=1, a(n) = n*3^(n-1) + a(n-1).at n=6A014915
- Numbers k such that the continued fraction for sqrt(k) has period 86.at n=17A020425
- Fibonacci sequence beginning 3, 17.at n=14A022127
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 42.at n=38A031540
- Numbers whose set of base-12 digits is {1,4}.at n=25A032824
- Number of permutations (p1,...,pn) such that 1 <= |pk - k| <= 2 for all k.at n=16A033305
- Number of ways to partition 2n into distinct positive integers.at n=28A035294
- Square array T(n,k) read by antidiagonals where T(0,k) = 0 and T(n,k) = 1 + 2k + 3k^2 + ... + n*k^(n-1).at n=58A059045
- Number of ways to partition 4*n into distinct positive integers.at n=14A078406
- a(n) = number of m such that A080737(m) <= 2n.at n=35A080740
- Triangle read by rows, generated from (..., 3, 2, 1).at n=42A108283
- Number of asymmetric mobiles (cycle rooted trees) with n nodes and 2-colored internal (non-leaf) nodes.at n=8A108532
- a(n) = 1 + 2*n + 3*n^2 + 4*n^3 + 5*n^4 + 6*n^5 + 7*n^6.at n=3A113532
- Even values of the PartitionsQ function A000009.at n=44A118303
- T(n, k) = 3*T(n-1, k-1) + T(n-1, k) for k < n and T(n, n) = 1, T(n, k) = 0, if k < 0 or k > n; triangle read by rows.at n=42A119673
- Number of unordered rooted trees where each subtree from given node has the same number of nodes.at n=26A127524
- Sum of squares of four consecutive primes.at n=11A133524
- Triangle read by rows: iterates of X * [1,0,0,0,...]; where X = an infinite lower bidiagonal matrix with [3,1,3,1,3,1...] in the main diagonal and [1,1,1,...] in the subdiagonal.at n=38A140071
- a(n) = 13*n^2 + 10*n + 1.at n=23A161587
- (1, 3, 5, 7, 9, ...) convolved with (1, 0, 3, 5, 7, 9, ...).at n=22A179903