5343
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7728
- Proper Divisor Sum (Aliquot Sum)
- 2385
- 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
- 3264
- Möbius Function
- -1
- Radical
- 5343
- 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
- 46
- 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
- Coordination sequence T2 for Zeolite Code FER.at n=45A008107
- Powers of cube root of 5 rounded down.at n=16A017988
- Numbers whose set of base-12 digits is {1,3}.at n=23A032919
- Numbers having four 3's in base 5.at n=25A043364
- Numbers whose base-4 representation contains exactly three 1's and three 3's.at n=31A045127
- Number of partitions of n into at most 1 copy of 1, 2 copies of 2, 3 copies of 3, ... .at n=39A052335
- Total sum of squares of parts in all partitions of n.at n=12A066183
- Array T(m,n) read by antidiagonals: if X and Y are two (possibly empty) finite sets with m and n elements respectively and Z is the disjoint union of X and Y, then T(m,n) is the number of self-inverse partial functions f:Z ->Z which do not fix any element of Y.at n=43A086363
- Least multiple of n == -1 (mod prime(n)).at n=38A090939
- Numbers m not of the form k*(k+2) that have a single '1' in the periodic part of the continued fraction of sqrt(n).at n=23A102538
- Numbers n such that 8*10^n + 7*R_n + 2 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=12A103091
- Number of nonempty subsets S of {1,2,3,...,n} that have the property that no element x of S is a nonnegative integer linear combination of elements of S-{x}.at n=20A103580
- Least number d such that 10^n -/+ d form a prime pair.at n=45A115564
- Numbers n such that the sum of the Euler totient functions of integers up to n is a square.at n=7A130697
- Floor of sum of the first n^2 square roots.at n=20A138357
- a(n) = n*(3*n + 20).at n=39A140689
- Bisection of toothpick sequence A139250.at n=53A159791
- Numbers k for which 6k+1, 24k+5, 432k^2+72k-1, and 432k^2+90k-1 are all prime.at n=13A175513
- Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having determinant equal to one, with rows and columns of the latter in nondecreasing lexicographic order.at n=18A227637
- Number of ballot sequences of length 2n with exactly n fixed points.at n=8A238803