7802
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 4294
- 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
- 3772
- Möbius Function
- -1
- Radical
- 7802
- 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
- 145
- 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
- a(n) = floor( n*(n-1)*(n-2)/25 ).at n=59A011907
- "BGK" (reversible, element, unlabeled) transform of 1,1,1,1,...at n=27A032058
- Sum of first n primes of form 4k-1.at n=41A038347
- Let m = number of ways of partitioning n into parts using all the parts of a subset of {1, 2, ..., n-1} whose sum of all parts of a subset is less than n; a(n) gives number of different subsets of {1, 2, ..., n-1} whose m is 0.at n=51A088528
- Series expansion of (eta(q^9) / eta(q))^3 in powers of q.at n=12A121589
- Expansion of (eta(q)eta(q^9)/eta(q^3)^2)^6 in powers of q.at n=12A121592
- Let f(k) = exp(Pi*sqrt(k)); sequence gives numbers k such that ceiling(f(k)) - f(k) < 1/10^3.at n=20A127022
- a(n) = 289*n - 1.at n=26A158253
- Number of distinct values taken by w^w^...^w (with n w's and parentheses inserted in all possible ways) where w is the first transfinite ordinal omega.at n=11A199812
- The period after which the powers of n repeat on an 8-digit calculator.at n=7A216068
- Expansion of q * (f(q^9) / f(q))^3 in powers of q where f() is a Ramanujan theta function.at n=12A227454
- Number of partitions p of n such that 2(number of parts of p) - min(p) is a part of p.at n=49A238587
- Start of a triple of consecutive squarefree numbers each of which has exactly 3 distinct prime factors.at n=47A242606
- a(n) = A087803(n) - n + 1.at n=11A255170
- 4-digit numbers (with leading zeros supplied where necessary) in which the sum of the number consisting of the first two digits and the number consisting of the last two digits equals the number consisting of the middle two digits.at n=52A263194
- Number of partitions of (4, n) into a sum of distinct pairs.at n=20A268347
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 654", based on the 5-celled von Neumann neighborhood.at n=29A273332
- Numbers n such that A003145(n) = floor(alpha^2*n)+1, where alpha = 1.839... is the positive real zero of x^3-x^2-x-1.at n=21A278352
- Number of n X 2 0..1 arrays with the number of 1's king-move adjacent to some 0 equal to the number of 0's adjacent to some 1, with top left element zero.at n=7A284107
- T(n,k) = Number of n X k 0..1 arrays with the number of 1's king-move adjacent to some 0 equal to the number of 0's adjacent to some 1, with top left element zero.at n=37A284113