7808
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 15810
- Proper Divisor Sum (Aliquot Sum)
- 8002
- 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
- 122
- Omega Function (Ω)
- 8
- 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
- 26
- 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 that are the sum of 2 positive 5th powers.at n=16A003347
- Numbers that are the sum of at most 2 positive 5th powers.at n=23A004842
- f-vectors for simplicial complexes of dimension at most 1 (graphs) on at most n-1 vertices.at n=36A011826
- Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (4,k)-perfect numbers.at n=39A019293
- Positive numbers k such that k = x^5 + y^5 has a solution in nonzero integers x, y.at n=31A020896
- Expansion of tan(tan(x) * x)/2.at n=4A024265
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 1, 3, 1, 1.at n=12A025255
- Expansion of 1/((1-2*x)*(1-6*x)*(1-9*x)*(1-11*x)).at n=3A028000
- Expansion of (theta_3(z)*theta_3(2z)+theta_2(z)*theta_2(2z))^4.at n=31A028579
- Expansion of (theta_3(z)*theta_3(9z)+theta_2(z)*theta_2(9z))^4.at n=35A028604
- 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 43.at n=29A031541
- Number of partitions in parts not of the form 19k, 19k+1 or 19k-1. Also number of partitions with no part of size 1 and differences between parts at distance 8 are greater than 1.at n=41A035970
- Numbers whose base-3 representation has exactly 9 runs.at n=33A043589
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9.at n=33A043806
- Numbers k such that number of runs in the base 3 representation of k is congruent to 9 mod 10.at n=33A043824
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 9 skipped primes.at n=41A050776
- Sum of 5th powers of digits of n.at n=26A055014
- Number of partitions of n with nonnegative crank.at n=35A064428
- Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+9), n>=0.at n=5A067987
- a(n) = 2^n + 6^n.at n=5A074601