7953
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
- 11616
- Proper Divisor Sum (Aliquot Sum)
- 3663
- 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
- 4800
- Möbius Function
- -1
- Radical
- 7953
- 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
- 96
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = 4*a(n-1) - a(n-2), with a(0) = 1, a(1) = 1.at n=8A001835
- a(n) = 4*a(n-2) - a(n-4) for n > 1, a(n) = n for n = 0, 1.at n=15A002530
- a(n) = (1 + a(n-1)*a(n-2))/a(n-3), a(0) = a(1) = a(2) = 1.at n=16A005246
- 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 58.at n=36A031556
- Numbers whose base-5 representation contains exactly two 2's and three 3's.at n=32A045273
- Sizes of successive clusters in Z^4 lattice.at n=40A046895
- a(2n+1) = a(2n) + a(2n-1), a(2n) = 2*a(2n-1) + a(2n-2); a(n) = n for n = 0, 1.at n=15A048788
- 17-gonal (or heptadecagonal) numbers: a(n) = n*(15*n-13)/2.at n=33A051869
- Partial sums of A054469.at n=8A054470
- Transform of A059226 applied to sequence 0, 0, 1, 0, 0, 0, 0, ...at n=7A059273
- Numbers k such that the period of the continued fraction for sqrt(3)*k is 2.at n=44A064933
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=13A066509
- Gives an LCD representation of n.at n=15A071843
- Generalized Markoff numbers: union of numbers a, b, c, d satisfying the Markoff(4) equation a^2 + b^2 + c^2 + d^2 = 4*a*b*c*d.at n=11A075276
- a(n) = Sum_{i=1..n} LookAndSay(i).at n=16A079664
- a(n) = 4*a(n-1) - a(n-2) with a(1) = 1, a(2) = 3.at n=7A079935
- Square array of numbers T(n,k) = ((1+sqrt(3))*(k+sqrt(3))^n-(1-sqrt(3))*(k-sqrt(3))^n)/(2*sqrt(3)), read by antidiagonals.at n=52A086404
- Let b(0)=1; b(1)=1; b(n+2) = (Pi^2/6 + 6/Pi^2)*b(n+1) - b(n). a(n) = floor(b(n)).at n=18A093607
- Array T(k,n) read by antidiagonals. G.f.: x(1-x)/(1-kx+x^2), k>1.at n=52A094954
- Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n.at n=8A098936