7655
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9192
- Proper Divisor Sum (Aliquot Sum)
- 1537
- 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
- 6120
- Möbius Function
- 1
- Radical
- 7655
- 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
- Numbers with exactly 7 1's in their ternary expansion.at n=23A023698
- n written in fractional base 8/7.at n=29A024649
- Scan decimal expansion of log(2) until all n-digit strings have been seen; a(n) is number of digits that must be scanned.at n=2A036905
- Square array read by antidiagonals with T(n,k)=T(n,k-1)^2-n*T(n,k-1)+1 and T(n,0)=0.at n=48A060137
- a(n) is the greatest integer m such that (1) written in factorial base it is also readable as if it is in base n and (2) this base-n value is greater than or equal to m.at n=2A065400
- Smallest integer >= 0 of the form x^3 - n^4.at n=22A070930
- Numbers k such that phi(phi(k)) = sum of prime factors of k.at n=12A075863
- a(n) = 4*n^2 + 6*n + 1.at n=43A082108
- Inverse of number-theoretic triangle A109974.at n=42A109977
- Numbers k such that k has nonincreasing digits and the k-th prime has nondecreasing digits.at n=44A116069
- a(n) = 2*a(n-1) + 5*a(n-2) for n > 1; a(0) = 1, a(1) = 5.at n=7A123011
- Records in A018892.at n=44A126097
- Numbers k such that A128162(k) is prime.at n=19A128163
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 0100-0100-1111-0100 pattern in any orientation.at n=15A147041
- Joint-rank array of the numbers (3*i+1)*3^j, where i>=0, j>=0, by antidiagonals.at n=47A182949
- Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x-1 and x^2 are in a.at n=50A191289
- Dispersion of (3*n-1), read by antidiagonals.at n=47A191450
- a(n) = (7*3^n + 1)/2.at n=7A199109
- T(n,k)=Number of nXk 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.at n=52A208637
- Square array A by downward antidiagonals: A(n,k) = (3 + 3^n*(2*floor(3*k/2) - 1))/6, n,k >= 1; read as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...at n=52A254051