5173
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5920
- Proper Divisor Sum (Aliquot Sum)
- 747
- 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
- 4428
- Möbius Function
- 1
- Radical
- 5173
- 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
- 103
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 3 positive 5th powers.at n=29A003348
- Coordination sequence T3 for Zeolite Code BRE.at n=47A008060
- Numbers k such that the continued fraction for sqrt(k) has period 86.at n=7A020425
- n written in fractional base 9/5.at n=48A024653
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 34 ones.at n=27A031802
- Number of partitions of n with equal number of parts congruent to each of 0 and 3 (mod 5).at n=37A035554
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 1 (mod 5).at n=44A035562
- Numbers having three 7's in base 9.at n=7A043483
- Composite and every divisor (except 1) contains the digit 7.at n=22A062676
- a(1) = 1; for n>1, a(n) = smallest number with all odd digits giving a prime in concatenation with the previous terms.at n=38A069604
- Third differences of partition numbers A000041.at n=64A072380
- Number of monotone n-weightings of complete bipartite digraph K(4,2).at n=5A085464
- a(n) = (1/3)*n^3 - n^2 - (1/3)*n - 1.at n=26A109620
- Partial sums of A102540 (primes that are not Chen primes).at n=23A115606
- Binomial centered tridigonal matrices as a triangular sequence: t(n,m.d)=If[n + m - 1 == d, binomial[d - 1, n - 1], If[n + m == d, -1, If[n + m - 2 == d, -1, 0]]].at n=23A124030
- Least power of 3 having a run of exactly n consecutive 5's in its decimal representation.at n=6A131548
- Positive integers whose sixth power is the sum of seven sixth powers (smallest primitive solutions).at n=19A132410
- Number of different values of i^2+j^2+k^2+l^2+m^2+n^2 for i,j,k,l,m,n in [0,n].at n=31A132438
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 01000-11111-00010 pattern in any orientation.at n=17A147015
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k cycles with at most 2 alternating runs (it is assumed that the smallest element of the cycle is in the first position), 0<=k<=n.at n=40A187247