7347
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10240
- Proper Divisor Sum (Aliquot Sum)
- 2893
- 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
- 4680
- Möbius Function
- -1
- Radical
- 7347
- 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
- 163
- 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
- Number of partitions of n that do not contain 10 as a part.at n=32A027344
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 56.at n=32A031554
- a(n) = n-th prime number * n-th lucky number.at n=21A032601
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048225.at n=20A048235
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=13A049949
- Start with x, xy; then concatenate each word in turn with all preceding words, getting x xy xxy xxxy xyxxy xxxxy xyxxxy xxyxxxy ...; sequence gives number of words of length n. Also binary trees by degree: x (x,y) (x,(x,y)) (x,(x,(x,y))) ((x,y),(x,(x,y)))...at n=16A063895
- Numbers k such that prime(k) + prime(k+1) is a square.at n=24A064397
- Expansion of (1+x^3*C)*C^4, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.at n=7A071729
- a(1) = 1; a(n) = Sum_{k=1..n-1} a(floor((n-1)/k)).at n=41A078346
- a(n) = rightmost term in M^n * [1 0 0]. M = the 3 X 3 stiffness matrix [1 -1 0 / -1 4 -3 / 0 -3 3].at n=5A094432
- Numbers k such that prime(k) + prime(k+1) is a perfect power.at n=30A132746
- 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, 1, 1), (0, 1, 1), (1, 0, 0), (1, 1, -1)}.at n=7A150289
- Base-10 encoding of the Spanish name of n with one digit per letter as on a touch-tone telephone.at n=6A165948
- Partial sums of A023201.at n=42A172295
- n such that the Moebius function take successively, from n, the values -1,0,-1,0,-1,0.at n=36A172354
- Numbers that are the product of 3 distinct primes a,b and c, such that a+b+c, a^2+b^2+c^2 and a^3+b^3+c^3 are prime numbers.at n=13A176911
- Numbers n that (n^3 - 4,n^3 - 2) is a twin prime pair.at n=31A178507
- a(n)=(A210686(n)-1)/30.at n=37A181903
- Iterate the map in A006369 starting at 144.at n=45A185589
- Numbers n such that the n-th digit (after the decimal point) in the decimal expansion of Pi are the occurrence of the least significant digit represented by the more significant digits.at n=13A201545