7386
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14784
- Proper Divisor Sum (Aliquot Sum)
- 7398
- 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
- 2460
- Möbius Function
- -1
- Radical
- 7386
- 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
- 70
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of 1/((1-x^2)*(1-x^4)^2*(1-x^6)*(1-x^8)*(1-x^10)) (even powers only).at n=38A001994
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*(1-x^4)).at n=40A002621
- Number of equivalence classes of binary sequences of period n.at n=20A002729
- a(n) = prime(n)*prime(n-1) - 1.at n=23A023515
- Numbers whose maximal base-9 run length is 4.at n=14A037999
- Numbers having four 1's in base 9.at n=9A043460
- Numbers whose base-3 representation has exactly 9 runs.at n=2A043589
- Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 8.at n=18A043799
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9.at n=2A043806
- Numbers k such that number of runs in the base 3 representation of k is congruent to 9 mod 10.at n=2A043824
- Duplicate of A002729.at n=20A062163
- Let f(1)=f(2)=1, f(k)=f(k-1)+f(k-2)+ (k (mod n)). Then f(k)=floor(r(n)*F(k))+g(k) where F(k) denotes the k-th Fibonacci number and g(k) a function becoming periodic. Sequence depends on r(n) which is the largest positive root of : a(3n-2)*X^2-a(3n-1)*X+a(3n)=0.at n=43A081420
- Sum of ordered 3 prime sided prime triangles.at n=33A105100
- Partial sums of A102540 (primes that are not Chen primes).at n=28A115606
- Row sums of triangle A131424.at n=34A131425
- Numbers k such that the numerator of the Bernoulli number B(2k) ends with the digits 691.at n=27A132184
- 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, 0), (-1, 0, 0), (0, 1, -1), (1, 0, -1), (1, 0, 1)}.at n=8A149319
- Sums of 3 consecutive semiprimes.at n=32A173968
- Sums of three consecutive numbers each of which is the product of two distinct primes and each of which has no exponent greater than one for either of its two prime factors.at n=30A173969
- The numbers n in s=n^2 + (n+1)^2 that satisfy the requirement for two consecutive squares c,d with c<d with d-c being the sum of two consecutive squares that c<s<d will give s-c and d-s both being squares.at n=15A192743