6275
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7812
- Proper Divisor Sum (Aliquot Sum)
- 1537
- 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
- 5000
- Möbius Function
- 0
- Radical
- 1255
- Omega Function (Ω)
- 3
- 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
- 36
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Nearest integer to Gamma(n + 4/9)/Gamma(4/9).at n=8A020022
- Ceiling of Gamma(n+4/9)/Gamma(4/9).at n=8A020112
- Number of connected functions on n points with a loop of length 4.at n=9A029853
- Numbers having four 0's in base 5.at n=32A043352
- Numbers k such that 275*2^k + 1 is prime.at n=20A053354
- a(n) = 10*n^2+n.at n=24A055437
- Composite and every divisor (except 1) contains the digit 5.at n=42A062672
- Numbers k such that prime(k) == 1 (mod sigma(k)).at n=11A067697
- Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.at n=12A070192
- EULER transform of A002620 (with the initial 0,0,1 omitted).at n=10A072338
- a(n) = A077698(n+1)/A077698(n).at n=14A077699
- a(n) = smallest k where (10^k+1)=0 mod prime(n)^2, or 0 if no such k exists.at n=53A086981
- Number of 4 X 4 symmetric magic squares with line sum 2n.at n=9A093198
- Integer part of n#/((p-7)# 7#), where p=preceding prime to n.at n=29A102788
- Odd numbers n such that there exists a solution to lcm(s,z-s) = n, lcm(t,z-t) = n-2 and 0 < s+t < z < n.at n=25A108157
- G.f. satisfies: A(x) = G(x)*A(x^2*G(x)) where G(x) is the g.f. of the Motzkin numbers (A001006): G = (1 + x*G + x^2*G^2).at n=10A121399
- Similar to A072921 but starting with 4.at n=33A152233
- Number of subsets of {1, 2, ..., n} containing n and having <=8 pairwise coprime elements.at n=31A186992
- Smallest number k such that the number of distinct residues of x^k (mod k) equals n.at n=54A196330
- Number of 4-tuples (w,x,y,z) with all terms in {1,...,n} and w*x>2*y*z.at n=12A211797