6268
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
- 6
- Divisor Sum
- 10976
- Proper Divisor Sum (Aliquot Sum)
- 4708
- 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
- 3132
- Möbius Function
- 0
- Radical
- 3134
- 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
- 62
- 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
- yes
- Odd
- no
Appears in sequences
- Number of bond-rooted polyenoids with n edges.at n=8A000913
- Numbers whose base-5 representation contains exactly three 0's and no 1's.at n=43A045169
- Numbers whose base-5 representation contains exactly three 0's and two 3's.at n=14A045201
- Numbers k such that k^512 + 1 is prime.at n=19A057465
- Numbers k such that Sum_{j=1..k} A001065(j) is divisible by k.at n=12A063901
- Number of ways to partition n into distinct positive integers <= phi(n), where phi is Euler's totient function (A000010).at n=55A079124
- Least k such that the distance from k^2 to closest prime = n or zero if no k exists.at n=44A079666
- Map from binary trees of size n to the set of corresponding trivalent plane trees (tpt) represented as size 2n+1 general trees.at n=19A083930
- Left truncatable 3-almost primes, in which repeatedly deleting the leftmost digit gives a 3-almost prime at every step until a single-digit 3-almost prime remains.at n=39A085248
- a(1)=3; a(n)=floor((20+sum(a(1) to a(n-1)))/6).at n=50A120180
- G.f.: A(x) = A_1 where A_1 = 1/[1 - x*(A_2)^3], A_2 = 1/[1 - x^2*(A_3)^3], A_3 = 1/[1 - x^3*(A_4)^3], ... A_n = 1/[1 - x^n*(A_{n+1})^3] for n>=1.at n=12A132334
- Number of binary strings of length n with no substrings equal to 0001 0101 or 0111.at n=17A164470
- Partial sums of A028388 good primes (version 2).at n=29A172166
- Number of (w,x,y,z) with all terms in {1,...,n} and 2w*x<=3*y*z.at n=10A211921
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2.at n=32A213070
- Numbers k such that 3^k + 8 is prime.at n=18A217136
- Trisection of A107926: The least number k such that there are primes p and q with p - q = 6*n, p + q = k, and p the least such prime >= k/2.at n=41A231156
- Length of the maximal prefix of noncomposite numbers on row n of A249821.at n=53A250473
- Position of the n-th prime in A253279.at n=29A255999
- Numbers such that antisigma(n) mod sigma(n) = d(n), where antisigma(n) is the sum of the numbers less than n that do not divide n, sigma(n) is the sum of the divisors of n and d(n) is the number of divisors of n.at n=43A272337