7936
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 16352
- Proper Divisor Sum (Aliquot Sum)
- 8416
- 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
- 3840
- Möbius Function
- 0
- Radical
- 62
- Omega Function (Ω)
- 9
- 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
- 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
- Euler or up/down numbers: e.g.f. sec(x) + tan(x). Also for n >= 2, half the number of alternating permutations on n letters (A001250).at n=9A000111
- Tangent (or "Zag") numbers: e.g.f. tan(x), also (up to signs) e.g.f. tanh(x).at n=4A000182
- Number of permutations of length n with exactly three valleys.at n=1A000517
- Number of basic invariants for cyclic group of order and degree n.at n=18A002956
- Boustrophedon version of triangle of Euler-Bernoulli or Entringer numbers read by rows.at n=53A008280
- Boustrophedon version of triangle of Euler-Bernoulli or Entringer numbers read by rows.at n=54A008280
- Triangle of Euler-Bernoulli or Entringer numbers read by rows.at n=53A008281
- Triangle of Euler-Bernoulli or Entringer numbers read by rows.at n=54A008281
- Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1.at n=43A008282
- Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1.at n=45A008282
- Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1.at n=44A008282
- Read across rows of Euler-Bernoulli or Entringer triangle.at n=28A008283
- Triangle of coefficients in expansion of D^n (tan x) in powers of tan x.at n=29A008293
- Triangle of coefficients in expansion of D^n (tan x) in powers of tan x.at n=24A008293
- Triangle read by rows: T(n,k) (n >= 1, 0 <= k <= ceiling(n/2)-1) = number of permutations of [n] with k peaks.at n=19A008303
- Triangle read by rows: T(n,k) (n >= 1, 0 <= k <= ceiling(n/2)-1) = number of permutations of [n] with k peaks.at n=24A008303
- Triangle of tangent numbers.at n=20A008308
- a(n) = 2^(2n+3) - 2^n*(n+3).at n=6A008464
- Triangle T(n,k) = P(n,k)/2, n >= 2, 1 <= k < n, of one-half of number of permutations of 1..n such that the differences have k runs with the same signs.at n=35A008970
- Expansion of e.g.f.: 1 + tan(x).at n=9A009006