7782
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
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15576
- Proper Divisor Sum (Aliquot Sum)
- 7794
- 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
- 2592
- Möbius Function
- -1
- Radical
- 7782
- 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
- 39
- Smith Number
- yes
- 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) = 10000*log_10(n) rounded to the nearest integer.at n=5A004229
- a(n) = 10000*log_10(n) rounded up.at n=5A004230
- Number of n-step self-avoiding walks on a Manhattan lattice.at n=15A006744
- Exponential convolution of Fibonacci numbers with themselves.at n=9A014334
- 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 88.at n=2A031586
- Sums of distinct powers of 6.at n=34A033043
- Positive numbers having the same set of digits in base 2 and base 6.at n=30A037411
- Sums of 2 distinct powers of 6.at n=11A038478
- Numbers having four 0's in base 6.at n=10A043372
- a(n+2) = 5*a(n+1) - 2*a(n), with a(0) = 1, a(1) = 4.at n=6A052913
- Sums of two powers of 6.at n=16A055257
- Numbers which are the sum of their proper divisors containing the digit 9.at n=23A059468
- Integers y such that for some integer x we have uphi(x) = uphi(y) = x-y, where uphi(n) = A047994(n) is the unitary totient function: If n = Product p_i^e_i, uphi(n) = Product (p_i^e_i - 1).at n=9A067741
- Array T(m,n) read by antidiagonals: T(m,n) = number of ways of 3-coloring an m X n grid (m >= 1, n >= 1).at n=33A078099
- Array T(m,n) read by antidiagonals: T(m,n) = number of ways of 3-coloring an m X n grid (m >= 1, n >= 1).at n=30A078099
- a(n) = 5*a(n-2) - 2*a(n-4), with initial terms 0,1,2,4.at n=13A079162
- Numbers n such that phi(n) = phi(n + phi(n)).at n=41A108569
- a(n) = n^5+n.at n=6A131471
- Triangle, read by rows, T(n, k) = binomial(n, k) for n < 2 and binomial(n, k) + n^(n-1) * binomial(n-2, k-1) otherwise.at n=26A146990
- Triangle, read by rows, T(n, k) = binomial(n, k) for n < 2 and binomial(n, k) + n^(n-1) * binomial(n-2, k-1) otherwise.at n=22A146990