5170
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 10368
- Proper Divisor Sum (Aliquot Sum)
- 5198
- 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
- 1840
- Möbius Function
- 1
- Radical
- 5170
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 54
- 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
- Number of partitions of n that do not contain 1 as a part.at n=39A002865
- a(n) = round(1000*log_2(n)).at n=35A004266
- a(n) = ceiling(1000*log_2(n)).at n=35A004267
- Numbers k such that sigma(k) = sigma(k+8).at n=13A015876
- n written in fractional base 9/5.at n=45A024653
- a(n) = (d(n)-r(n))/5, where d = A026043 and r is the periodic sequence with fundamental period (0,2,3,0,0).at n=39A026045
- Partial sums of A007587.at n=9A051799
- Numbers k such that k^18 == 1 (mod 19^3).at n=12A056089
- Sum of the remainders when the n-th triangular number is divided by all smaller triangular numbers > 1.at n=42A072524
- Squarefree numbers having exactly three prime gaps.at n=17A073489
- Numbers having exactly three prime gaps in their factorization.at n=21A073495
- Numbers n such that A078142(n) = A078142(n+1) = A078142(n+2), where A078142(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p.at n=3A073938
- Sum of even-indexed primes.at n=33A077126
- Numbers whose divisors can be partitioned in exactly one way into two disjoint sets with the same sum.at n=41A083209
- Number of partitions of n including 3, but not 1.at n=41A085811
- Radius of inscribed circle within primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=26A089551
- Number of partitions of n into at least two parts such that the product of largest and smallest part exceeds n.at n=49A116902
- Number of partitions of n in which both smallest and largest part occur only once.at n=38A117995
- Absolute value of the largest coefficient of Product[(1-x^k)^k,{k,1,n}].at n=5A120295
- 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, 0, 1), (-1, 1, 0), (0, -1, 1), (1, 0, 0), (1, 1, -1)}.at n=8A148738