6385
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7668
- Proper Divisor Sum (Aliquot Sum)
- 1283
- 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
- 5104
- Möbius Function
- 1
- Radical
- 6385
- 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
- 124
- Smith Number
- yes
- 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
- Number of fountains of n coins.at n=18A005169
- Numbers k such that the continued fraction for sqrt(k) has period 57.at n=7A020396
- Least m such that if r and s in {1/4, 1/8, 1/12, ..., 1/4n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=30A024839
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/(2*n)} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=29A024845
- Lucky numbers with size of gaps equal to 14 (lower terms).at n=32A031896
- Denominators of continued fraction convergents to sqrt(490).at n=8A041935
- Numbers whose base-5 representation contains exactly three 0's and two 2's.at n=33A045186
- Expansion of 1/((1-x)^5 - x^5).at n=11A049016
- T(n,n-4), where T is the array in A055830.at n=29A055831
- a(n) = (prime(n)^2 + 1)/2.at n=28A066885
- Number of times the n-th prime appears among the decimal digits of 2^(2^n) + 1, the Fermat numbers.at n=20A078671
- Third row of Pascal-(1,5,1) array A081580.at n=19A081589
- a(n) is the sum of the preceding terms that are coprime to n.at n=27A082865
- Number of walks of length 2n+1 between two nodes at distance 3 in the cycle graph C_10.at n=6A095932
- Indices of primes in sequence defined by A(0) = 79, A(n) = 10*A(n-1) - 51 for n > 0.at n=8A101138
- a(n) = 8*n^2 + 4*n + 1.at n=28A102083
- Triangular matrix, read by rows, equal to the matrix logarithm of triangle A105623.at n=50A105629
- Numbers whose anti-divisors sum to a prime.at n=35A109350
- Expansion of (1 + x - x^3 - 2*x^4)/(1 - x^2 - x^3 - x^4 - x^5).at n=23A109544
- Least k such that prime(n)^2 divides binomial(2k,k).at n=29A110494