7708
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14112
- Proper Divisor Sum (Aliquot Sum)
- 6404
- 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
- 3680
- Möbius Function
- 0
- Radical
- 3854
- Omega Function (Ω)
- 4
- 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
- 52
- 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 the continued fraction for sqrt(k) has period 56.at n=33A020395
- Larger members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).at n=26A054572
- Numbers n such that x^n + x^13 + 1 is irreducible over GF(2).at n=15A057483
- Second 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n+7)/2.at n=41A062728
- Numbers k such that 6*R_k - 5 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=20A098088
- Numbers k such that sigma(k) plus the k-th prime is a triangular number.at n=27A115907
- Numbers k such that k and k^2 together contain all ten digits.at n=20A122477
- Indices k such that A020508(k)=Phi[k](-9) is prime, where Phi is a cyclotomic polynomial.at n=50A138921
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n+1)*Sum[Binomial[n-m, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=38A146774
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n+1)*Sum[Binomial[n-m, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=42A146774
- a(n) = n*(14*n + 13) + 3.at n=23A195029
- Number of nX3 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nX3 array.at n=9A219910
- a(n) = floor(n^2 * log(n)).at n=44A235707
- Numbers n such that n + 15, n^2 + 15 and n^3 + 15 are prime.at n=50A253143
- Numbers n with the property that it is possible to write the base 2 expansion of n as concat(a_2,b_2), with a_2>0 and b_2>0 such that, converting a_2 and b_2 to base 10 as a and b, we have (sigma(a)-a)*(sigma(b)-b) = sigma(n).at n=0A259832
- Numbers k such that (91*10^k + 11)/3 is prime.at n=25A271822
- Condensed deep factorization of n, A300562(n) written in decimal: floor of odd part of A300561(n) divided by 2.at n=11A300563
- Number of ways to choose a constant rooted partition of each part in a constant rooted partition of n.at n=40A301763
- Expansion of Product_{k>=1} ((1 - x)^k + x^k)/((1 - x)^k - x^k).at n=9A318570
- Number of integer partitions of n with unsortable prime factors.at n=38A326332