8329
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 8330
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 8328
- Möbius Function
- -1
- Radical
- 8329
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1045
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Eight iterations of Reverse and Add are needed to reach a palindrome.at n=23A015988
- Primes that remain prime through 3 iterations of function f(x) = 5x + 6.at n=27A023285
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=7A031830
- Largest prime substring in 3^n (0 if none).at n=26A046269
- Largest prime substring in 9^n (0 if none).at n=13A046275
- Numerators of b(n) = (1/16^n)*(4/(8*n+1) - 2/(8*n+4) - 1/(8*n+5) - 1/(8*n+6)).at n=18A048581
- Primes p for which the period of reciprocal = (p-1)/8.at n=16A056213
- An approximation to sigma_{5/2}(n): ceiling( sum_{d|n} d^(5/2) ).at n=36A058274
- Numbers which need eight 'Reverse and Add' steps to reach a palindrome.at n=18A065213
- Primes containing 2k digits in which the sum of the first k digits is that of the last k digits.at n=51A068896
- Take A000040, omit commas: 23571113171923..., select 4-digit primes seen when scanning from left.at n=29A073037
- Number of compositions of n into twin primes (i.e., primes that are members of a twin prime pair, like 3, 5, 7, 11, 13, but not 2 or 23).at n=41A077608
- First differences of A084449.at n=36A084465
- Primes appearing as the concatenation of the last two digits of prime(A086102(n)) and the first two digits of prime(A086102(n)+1).at n=8A086103
- Primes such that a sum of any two adjacent digits is prime; first and last digits are considered adjacent.at n=30A086244
- Primes which are also prime if their base 64 representation is interpreted as a base 10 number.at n=25A090717
- Primes p = p_(n+1) such that p_n + p_(n+2) = 2*p_(n+1) + 12.at n=6A095673
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k returns (i.e., down steps hitting the x-axis).at n=60A097612
- Primes p such that q-p = 24, where q is the next prime after p.at n=13A098974
- a(n) = round(10000*log(n/10)).at n=22A104077