8385
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
- 16
- Divisor Sum
- 14784
- Proper Divisor Sum (Aliquot Sum)
- 6399
- 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
- 4032
- Möbius Function
- 1
- Radical
- 8385
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- yes
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- yes
- 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
- 65
- 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
- a(n) = (2*n+1)*(4*n+1).at n=32A014634
- Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(2,6).at n=8A018915
- a(n) = 3*a(n-1) - a(n-2) + 2*a(n-3) - 2*a(n-4).at n=8A019487
- Pseudoprimes to base 44.at n=42A020172
- Define the sequence UD(a(0),a(1)) by a(n) is the least integer such that a(n)/a(n-1) > a(n-1)/a(n-2)+1 for even n >= 2 and such that a(n)/a(n-1) > a(n-1)/a(n-2) for odd n>=2. This is UD(2,16).at n=4A022018
- a(n) = n*(11*n+1)/2.at n=39A022269
- a(n) = (d(n)-r(n))/2, where d = A026057 and r is the periodic sequence with fundamental period (0,0,1,0).at n=39A026058
- Duplicate of A022269.at n=38A026817
- The (2^n+1)-th triangular number (cf. A000217).at n=7A028401
- a(n) = numerator of the X-coordinate of n*P where P is the generator [0,0] for rational points on the curve y^2 + y = x^3 - x.at n=14A028940
- Numerator of x-coordinate of (2n+1)*P where P is the generator for rational points on the curve y^2 + y = x^3 - x.at n=7A028944
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=3A031947
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=3A049357
- a(n) = T(n,n-6), array T as in A055801.at n=26A055806
- Number of step cyclic shifted sequence structures using a maximum of two different symbols.at n=22A056429
- Numbers of n-digit primes that undulate.at n=5A057333
- a(n) = 49*(n*(n+1)/2) + 6.at n=18A061792
- Smallest triangular number with digit sum n (or 0 if no such number exists).at n=23A062688
- Duplicate of A062688.at n=24A067181
- Number of divisors of n equals the average of distinct prime factors of n.at n=32A067547