7962
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15936
- Proper Divisor Sum (Aliquot Sum)
- 7974
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2652
- Möbius Function
- -1
- Radical
- 7962
- Omega Function (Ω)
- 3
- 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
- 26
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of down/up (initially descending) compositions of n.at n=22A025049
- Numbers m such that m^2 ends in 444.at n=31A039685
- Denominators of continued fraction convergents to sqrt(159).at n=13A041293
- 4n^2+1, 2n^2+1, 2n^2-1 are all prime.at n=20A055755
- Alternating sum along antidiagonals of the array of A129952 and its iterated differences.at n=12A130002
- a(n) = floor(n^sqrt(2*Pi)).at n=35A134887
- 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, 0), (-1, 0, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 0)}.at n=9A148630
- a(n) = p(n)*p(n+2)-p(n+1), where p(n) is the n-th prime.at n=22A152530
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209573; see the Formula section.at n=51A209574
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210235; see the Formula section.at n=50A210236
- Area of the Robbins pentagons.at n=39A228517
- Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=14A228963
- Smallest sets of 7 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=2A228964
- Concatenate the n-th prime with the n-th semiprime.at n=21A262428
- Numbers k such that (16*10^k - 19)/3 is prime.at n=27A271146
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 590", based on the 5-celled von Neumann neighborhood.at n=29A273117
- Numbers n that have an equal number of even and odd values of A001221(k) for 1 <= k <= n.at n=6A275547
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of Product_{j>=1} 1/(1 - j^k*x^j)^j.at n=49A294582
- Number of chordless cycles in the n-triangular graph.at n=6A297670
- Number of degrees of irreducible representations of symmetric group S_n that appear more than once.at n=36A318558