6289
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6640
- Proper Divisor Sum (Aliquot Sum)
- 351
- 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
- 5940
- Möbius Function
- 1
- Radical
- 6289
- 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
- 62
- 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
- Pseudoprimes to base 31.at n=27A020159
- Number of partitions in parts not of the form 17k, 17k+1 or 17k-1. Also number of partitions with no part of size 1 and differences between parts at distance 7 are greater than 1.at n=40A035962
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 8.at n=37A064906
- a(n) = n * prime(prime(n)).at n=18A080697
- Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(60+I*11)/61.at n=35A084804
- Smallest number which requires n iterations to reach a prime when iterating x + sum of squares of digits of x.at n=30A094658
- Indices k >= 8 designating the k-Somos sequences that first become nonintegral at odd-indexed terms (i.e., positions of odd terms in A030127).at n=47A101591
- A version of F. K. Hwang's sequence in {3*k, 3*k+1, 3*k+2}.at n=36A123945
- a(3n) = floor(43*2^n/28) - 1, a(3n+1) = a(3n) + 3*2^(n-3), a(3n+2) = floor(17*2^n/7 - 6/7) for n>=3.at n=36A123946
- Numbers n such that n^3 is zeroless pandigital.at n=25A124628
- Number of base 19 circular n-digit numbers with adjacent digits differing by 2 or less.at n=5A124947
- Triangle of the numerators of the almost-harmonic numbers: n-th term in m-th row is numerator of (sum{k=1 to m} 1/k) - 1/n, 1<=n<=m.at n=38A125900
- Numbers m such that m divides Sum_{k=1..m} prime(k)^16.at n=2A131276
- Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, 1)}.at n=9A151367
- a(n) = (4*n^3-3*n^2+5*n-3)/3.at n=16A177342
- G.f.: (1+x)^(2*g)*(1+x^3)^(3*g)/((1-x^2)*(1-x^4))-x^(2*g)*(1+x)^4/((1-x^2)*(1-x^4)) for g=2.at n=58A199628
- An avoidance sequence for a pair of tree patterns that is not the avoidance sequence for any set of permutations.at n=36A221720
- Fundamental discriminants d uniquely characterizing all complex biquadratic fields Q(sqrt(-3),sqrt(d)) which have 3-class group of type (3,3) and second 3-class group isomorphic to SmallGroup(729,37).at n=3A250240
- a(1) = 2, and for n>1: a(n) = prime(A251719(n)) * prime(A251719(n) + n - 2), where prime(n) gives the n-th prime.at n=60A251724
- Numbers k such that k^4096 + (k+1)^4096 is prime.at n=4A274236