8043
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12288
- Proper Divisor Sum (Aliquot Sum)
- 4245
- 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
- 4584
- Möbius Function
- -1
- Radical
- 8043
- 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
- 52
- 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
- Number of bipartite partitions of n white objects and 7 black ones.at n=9A002756
- Number of bipartite partitions of n white objects and 9 black ones.at n=7A002758
- Odd numbers with only palindromic prime factors whose sum is palindromic (counted with multiplicity).at n=25A046356
- Numbers of the form p*q*r where p,q,r are distinct odd palindromic primes (odd terms from A002385).at n=34A046405
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.at n=9A047826
- Becomes prime or 4 after exactly 8 iterations of f(x) = sum of prime factors of x.at n=27A048130
- a(n) = 1 + Sum_{i=1..n} phi(i)^2.at n=38A049454
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=32A052049
- Number of bracelets of length n using exactly three different colored beads.at n=10A056343
- Number of primitive (period n) bracelets using exactly three different colored beads.at n=10A056349
- Write 0, 1, 2, 3, 4, ... in a triangular spiral, then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0, 7, ...at n=42A062725
- Gives an LCD representation of n.at n=25A071843
- a(1) = 4 and then least composite such that every partial concatenation of 2 or more terms is a prime.at n=46A086474
- Numbers n such that A003313(n) = A003313(2n).at n=31A086878
- Convoluted convolved Fibonacci numbers G_j^(8).at n=8A089095
- Next term is the sum of previous term and the square of the sum of its decimal digits, with a(0) = 10.at n=27A112787
- Riordan array (-sqrt(4*x^2+8*x+1)+2*x+2, (sqrt(4*x^2+8*x+1)-2*x-1)/2).at n=40A121575
- Riordan array (2-2*x-sqrt(1-8*x+4*x^2), (1-2*x-sqrt(1-8*x+4*x^2))/2).at n=40A121576
- Expansion of 1/(1+x^2-x^3+x^4).at n=44A129903
- Central coefficients of the Riordan matrix A121576.at n=4A190734