7783
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8008
- Proper Divisor Sum (Aliquot Sum)
- 225
- 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
- 7560
- Möbius Function
- 1
- Radical
- 7783
- Omega Function (Ω)
- 2
- 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
- 83
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (F(2), F(3), ...).at n=14A024481
- Sums of distinct powers of 6.at n=35A033043
- Positive numbers having the same set of digits in base 2 and base 6.at n=31A037411
- Sums of 3 distinct powers of 6.at n=10A038479
- Differences between numbers k such that k and k+1 have the same sum of divisors.at n=32A054001
- Consider all integer triples (i,j,k), j,k>0, with binomial(i+2,3)=binomial(j+2,3)+k^3, ordered by increasing i; sequence gives i values.at n=32A054221
- A054221 without cubes.at n=14A054224
- Numbers k such that 70*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=7A056693
- Semiprimes p1*p2 such that p2 mod p1 = 9, with p2 > p1.at n=40A064907
- a(n) = n^(n-1) + n + 1.at n=5A066141
- Factorable subsets: the number of proper subsets S of {1,2,...,n} that can be expressed in the form S=A*B, where S is defined to be the set {a(i)*b(j)| a(i) in A, b(j) in B}.at n=23A068594
- Number of n-digit 4th powers.at n=16A102831
- a(1) = 335; a(n) is the smallest k > a(n-1) such that k*A002110(n)^30 - 1 is prime.at n=33A119760
- n times the n-th noncomposite.at n=42A164931
- Minimal number (in decimal representation) with n nonprime substrings in base-6 representation (substrings with leading zeros are considered to be nonprime).at n=19A217106
- Numbers of the form 6^j + 7^k, for j and k >= 0.at n=26A226819
- Number of bits necessary to represent u(n) in binary, where u is the Lucas-Lehmer sequence: u(0) = 100 (in binary); for n>0, u(n) = u(n-1)^2 - 2.at n=12A227615
- Number of (n+1) X (1+1) 0..4 arrays with every 2 X 2 subblock having the absolute values of all six edge and diagonal differences no larger than 1.at n=3A234029
- Number of (n+1)X(4+1) 0..4 arrays with every 2X2 subblock having the absolute values of all six edge and diagonal differences no larger than 1.at n=0A234032
- T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock having the absolute values of all six edge and diagonal differences no larger than 1.at n=6A234036