5870
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10584
- Proper Divisor Sum (Aliquot Sum)
- 4714
- 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
- 2344
- Möbius Function
- -1
- Radical
- 5870
- 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
- 142
- 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
- If a, b in sequence, so is ab+7.at n=42A009312
- a(n) = Sum_{k=0..floor(n/2)} A027157(n-k, k).at n=14A027167
- Numbers k such that 37*2^k+1 is prime.at n=26A032368
- a(n) = 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) = 4.at n=40A050053
- Cycles of rooted trees t where for each t all subtrees at root are distinct. n is total number of nodes.at n=13A052817
- Numbers k whose sum of digits exceeds the sum of the digits of k^3.at n=1A064209
- Sum of terms in n-th rows of triangle in A077159.at n=21A077162
- Row sums of A081964.at n=21A081966
- Unicode codes for the lunation runes, used in certain medieval Scandinavian perpetual calendar staves as golden numbers 1-19.at n=16A098476
- A transform of the Pell numbers.at n=12A099516
- Numbers n such that 2*10^n + 6*R_n + 3 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=13A102957
- a(n) = (p-1)! mod p^2 where p = n-th prime.at n=26A112660
- Least k such that k*(2^p-1)*(k*(2^p-1)-1)-1 is prime, where 2^p-1 runs through the Mersenne primes.at n=25A137906
- G.f. A(x) satisfies: A(x) = 1/(1-x)^2 + x^2*A'(x).at n=7A143918
- Number of lines through at least 2 points of a 4 X n grid of points.at n=40A160844
- Number of fixed polyominoes in equilibrium; a fixed polyomino is in equilibrium when its center of mass is vertically aligned with a cell with minimal coordinate.at n=11A171579
- Numbers m such that all three values m^2 + 13^k, k = 1, 2, 3, are prime.at n=27A178639
- Expansion of (1/(1-x-2x^2))*c(x/(1-x-2x^2)), c(x) the g.f. of A000108.at n=7A179533
- Number of lower triangles of an n X n 0..7 array with each element differing from all of its diagonal, vertical, antidiagonal and horizontal neighbors by two or less.at n=2A195247
- Number of lower triangles of a 3 X 3 0..n array with each element differing from all of its diagonal, vertical, antidiagonal and horizontal neighbors by two or less.at n=6A195249