5342
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8016
- Proper Divisor Sum (Aliquot Sum)
- 2674
- 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
- 2670
- Möbius Function
- 1
- Radical
- 5342
- 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
- 46
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence T7 for Zeolite Code MEL.at n=47A008156
- Start with 1, apply 1->12, 21->21, 22->21, 2->2 (for final 2); a(n) = length of n-th term.at n=26A013950
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (composite numbers).at n=25A025102
- 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 72.at n=11A031570
- Numbers whose base-5 representation contains exactly two 2's and three 3's.at n=16A045273
- Indices of primes in sequence defined by A(0) = 89, A(n) = 10*A(n-1) - 11 for n > 0.at n=12A101078
- Numbers whose square is a permutational number A134640.at n=22A134742
- 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), (1, -1, 0), (1, 0, 1), (1, 1, -1)}.at n=8A148960
- Numbers m such that m^2 is an anagram of a Fibonacci number.at n=9A162391
- Numbers that take a record number of steps to appear in A181391.at n=39A171863
- Sequence by greedy construction satisfying Lucier-Sárközy difference set condition.at n=41A174911
- (1, 3, 5, 7, 9, ...) convolved with (1, 0, 3, 5, 7, 9, ...).at n=20A179903
- Total number of parts that are the smallest part or the largest part in all partitions of n.at n=21A182978
- E.g.f. satisfies: A(x) = exp(x) - sqrt(1 - A(x)^2).at n=5A194453
- Number of different ways to select 6 disjoint subsets from {1..n} with equal element sum.at n=7A196233
- Numbers n such that (n^83-1)/(n-1) is prime.at n=43A217087
- Numbers n such that in Collatz (3x+1) trajectory of n, the number of terms < n equals number of terms > n.at n=18A217731
- G.f.: exp( Sum_{n>=1} x^n/n * Product_{k>=1} (1 + x^(n*k)*(1 + x^k)^n) ).at n=16A218576
- Number of 6 X 6 0..n matrices with each 2 X 2 subblock idempotent.at n=21A224668
- a(n) = 2*Sum_{k=0..n-1} C(n-1,k)*C(n+k,k) + n.at n=6A236407