7395
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
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 12960
- Proper Divisor Sum (Aliquot Sum)
- 5565
- 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
- 3584
- Möbius Function
- 1
- Radical
- 7395
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = 4*n^2 - 1.at n=43A000466
- a(n) = (4*n+1)*(4*n+3).at n=21A001539
- Pseudoprimes to base 86.at n=33A020214
- Numbers whose set of base-12 digits is {3,4}.at n=24A032836
- Numbers in which all pairs of consecutive base-7 digits differ by 3.at n=34A033078
- A Diaconis-Mosteller approximation to the Birthday problem function.at n=34A050255
- Numbers n such that n^2 - 1 is expressible as the sum of two nonzero squares in exactly one way.at n=28A050797
- a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^4.at n=8A053820
- a(n)= product of all odd composite numbers between n-th prime and (n+1)-st prime.at n=22A061215
- Numbers k such that sigma(k^2-k-1) = k*(k+1).at n=20A069826
- 2-nadirs of phi: numbers k such that phi(k-2) > phi(k-1) > phi(k) < phi(k+1) < phi(k+2).at n=37A076773
- Numbers k such that binomial(prime(k), k) is divisible by k^2.at n=19A081384
- Odd composite numbers k such that cototient(k) - phi(k) = k - 2*phi(k) is an odd prime.at n=4A083255
- Number of partitions of n into numbers having in binary representation at most trailing zeros.at n=38A087750
- Numbers m that are the hypotenuse of exactly 13 distinct integer-sided right triangles, i.e., m^2 can be written as a sum of two squares in 13 ways.at n=34A097102
- Primitive elements of A119432.at n=13A119433
- Positive numbers of the form 4*n^2 - 1 which are not semiprimes.at n=34A123754
- a(n) is the smallest number k larger than a(n-1) such that n*d(k)*sopf(k)=sigma(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472).at n=14A134382
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k DUUU's starting at level 1.at n=29A135331
- 3 times octagonal numbers: a(n) = 3*n*(3*n-2).at n=29A152751