7795
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9360
- Proper Divisor Sum (Aliquot Sum)
- 1565
- 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
- 6232
- Möbius Function
- 1
- Radical
- 7795
- 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
- 145
- 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 k such that the continued fraction for sqrt(k) has period 64.at n=41A020403
- Number of nondividing sets on {1,2,...,n}.at n=33A051014
- Numbers n such that n and the n-th prime have the same digits.at n=22A074350
- Number of upper triangular zero-one matrices with n ones and no zero rows or columns.at n=9A138265
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 1, -1), (1, 0, 0), (1, 0, 1)}.at n=7A150433
- Unhappy numbers which enter the cycle (4, 16, 37, 58, 89, 145, 42, 20) at 20.at n=39A193572
- Triangle read by rows: T(n,k) is the number of length-n ascent sequences without flat steps, containing k zeros.at n=56A218757
- Numbers k such that 3^k - 20 is prime.at n=25A219041
- Number T(n,k) of ascent sequences of length n with exactly k flat steps; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=45A242153
- Numbers n such that n + DigitProd(n) = 10^(A055642(n)).at n=3A242945
- Numbers k such that A = k+DigitProd(k) is divisible by the largest power of 10 <= A.at n=21A242948
- Least number k such that k + DigProd(k) = 10^n.at n=3A243198
- a(1) = a(2) = 2; a(n) = a(n-1) + gpf(a(n-2)), where gpf is greatest prime factor.at n=34A258125
- Numbers k such that 10^(k-1) - pi(k) is prime.at n=3A261620
- Number A(n,k) of k-ascent sequences of length n with no consecutive repeated letters; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=64A264909
- Numerators of expansion of PolyLog(-2, x)/PolyLog(2, x), where PolyLog(m, x) is the polylogarithm function.at n=3A266581
- a(n) begins the first chain of 9 consecutive positive integers of h-values with symmetrical gaps about the center, where h(k) is the length of the finite sequence k, f(k), f(f(k)), ...., 1 in the Collatz (or 3x + 1) problem.at n=33A268288
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 950", based on the 5-celled von Neumann neighborhood.at n=22A273829
- Numbers k such that (2*10^k + 49)/3 is prime.at n=21A280060
- Number of n X 7 0..1 arrays with every element equal to 0, 1 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=5A301963