7869
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10912
- Proper Divisor Sum (Aliquot Sum)
- 3043
- 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
- 5040
- Möbius Function
- -1
- Radical
- 7869
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 101
- 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
- Pseudoprimes to base 11.at n=23A020139
- 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 58.at n=32A031556
- Integer part of (Product(n^((1 + log(1 + i))/i^2), {i, 1, n})).at n=17A062486
- Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059.at n=8A063058
- Numbers n such that both n^4 + 2 and n^4 - 2 are prime.at n=32A071351
- a(1) = 10; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=41A111524
- Triangle interpolating the swinging factorial (A056040) restricted to odd indices with its binomial inverse. Triangle read by rows. For n >= 0, k >= 0.at n=28A163772
- Inverse binomial transform of the beta numbers 1/beta(n+1,n+1) (A002457).at n=7A163872
- Triangle read by rows: T(n,k) = round(c(n)/(c(k)*c(n-k))) where c are partial products of a sequence defined in comments.at n=57A172359
- Triangle read by rows: T(n,k) = round(c(n)/(c(k)*c(n-k))) where c are partial products of a sequence defined in comments.at n=63A172359
- Sum of the largest missing values in all compositions of n with the LMV property.at n=12A188577
- a(n) = Sum_{k=1..n} lcm(k,k')/gcd(k,k'), where n' is arithmetic derivative of n.at n=44A190120
- Number of 0..n arrays x(0..4) of 5 elements with zero 4th difference.at n=13A200156
- a(n) = 2^n - A210109(n).at n=14A210145
- Numbers n such that phi(n) = phi(n+12) and n is not divisible by 2.at n=20A217141
- Number of partitions of n not having depth 1; see Comments.at n=36A238003
- The number of partitions of n which represent Chomp positions with Sprague-Grundy value 8.at n=51A284781
- Length of n-th iterate of the mapping 00->0010, 01->001, 10->011, starting with 00.at n=20A289010
- Number of nX5 0..1 arrays with every element equal to 0, 1 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=5A301881
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=50A301884