8259
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11016
- Proper Divisor Sum (Aliquot Sum)
- 2757
- 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
- 5504
- Möbius Function
- 1
- Radical
- 8259
- 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
- 189
- 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
- a(n) = T(n, n-4), T given by A026519. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 4.at n=9A026524
- a(n) = T(n, n-4), T given by A026552. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=4.at n=9A026557
- 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 89.at n=33A031587
- Numbers that, when expressed in base 7 and then interpreted in base 10, yield a multiple of the original number.at n=25A032549
- a(n) = Sum_{ k, k|n } 2^(k-1).at n=13A034729
- a(1) = 1; a(n) = sum of terms in the continued fraction for the square of the continued fraction [a(1); a(2), a(3), a(4),..., a(n-1)].at n=32A061143
- When expressed in base 3 and then interpreted in base 8, is a multiple of the original number.at n=38A062889
- Numbers k that, when expressed in base 7 and then interpreted in base 10, give a multiple of k.at n=26A062944
- Expansion of 1/(1-3*x-2*x^2-3*x^3).at n=7A077830
- For n > 1, a(n) is the smallest number such that n-th concatenation is prime and the smallest palindrome beginning with (but not equal to) this concatenation is also prime.at n=17A088090
- a(1) = 668; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=29A105212
- Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n having pyramid weight k.at n=51A114597
- Numbers n such that n^k+(n+1)^k is prime for k = 1, 2, 4.at n=44A128780
- Sums of three consecutive pentagonal numbers.at n=42A129863
- 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, 0), (-1, 1, 1), (0, -1, 0), (0, 0, -1), (1, 0, 1)}.at n=8A149335
- Number of compositions of n in which each part has odd multiplicity.at n=16A242391
- Denominators of r-Egyptian fraction expansion for 1/e, where r(k) = 1/k!.at n=3A270524
- Squarefree numbers n for which A019565(n) < n and A048675(n) is also squarefree.at n=33A285319
- Irregular triangle read by rows: T(n,m) = number of lattice paths of type B^H terminating at point (n, m).at n=46A291085
- Number of compositions of n into parts with distinct multiplicities and with exactly six parts.at n=40A321776