6306
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12624
- Proper Divisor Sum (Aliquot Sum)
- 6318
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2100
- Möbius Function
- -1
- Radical
- 6306
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 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
- yes
- Odd
- no
Appears in sequences
- n written in fractional base 9/6.at n=33A024654
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 78.at n=16A031576
- a(n) = nextprime(3^n) - nextprime(2^n).at n=8A037128
- Numbers whose base-4 representation contains exactly two 0's and four 2's.at n=17A045051
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 91 ).at n=20A063364
- a(1) = 1 and for n > 1 let a(n) = a(n-1) + m, where m is the arithmetic mean of the largest subset of all predecessors such that m is an integer and m is maximal.at n=30A063676
- Numbers k such that the number of distinct primes dividing k = number of anti-divisors of k.at n=39A073713
- a(n) = 3^n - 2^n + 1.at n=8A083323
- Numbers k such that the three second-degree cyclotomic polynomials x^2 + 1, x^2 - x + 1 and x^2 + x + 1 are simultaneously prime when evaluated at x=k.at n=10A087277
- Triangle P, read by rows, that satisfies [P^6](n,k) = P(n+1,k+1) for n>=k>=0, also [P^(6*m)](n,k) = [P^m](n+1,k+1) for all m, where [P^m](n,k) denotes the element at row n, column k, of the matrix power m of P, with P(0,k)=1 and P(k,k)=1 for all k>=0.at n=11A111825
- Number of partitions of 5*6^n into powers of 6, also equals column 1 of triangle A111825, which shifts columns left and up under matrix 6th power.at n=3A111826
- Number of parts in all partitions of n in which no part occurs more than 3 times.at n=25A117148
- Row sums of A125605.at n=19A125606
- Number of n-tuples of numbers [0..5] (leading zeros allowed) in which adjacent digits differ by 4 or less.at n=5A126501
- Second-order Lucas numbers; a(n) = (2n+3)*Lucas(n) - n*Lucas(n-1).at n=12A134410
- a(n) = 9^n-4^n+1^n.at n=4A155630
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 1, read by rows.at n=30A157207
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 1, read by rows.at n=33A157207
- A sequence of triples of squarefree consecutive integers each composed of exactly three primes.at n=25A165936
- Sums of 3 consecutive semiprimes.at n=26A173968