6468
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 19152
- Proper Divisor Sum (Aliquot Sum)
- 12684
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1680
- Möbius Function
- 0
- Radical
- 462
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 49
- 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
- Theta series of 6-dimensional lattice A_6^(2) (other names for this lattice or the corresponding quadratic form are LAMBDA_{3,lambda}, P_6^(5), phi_6, F_14).at n=28A002706
- Number of genus 2 rooted maps with 1 face with n vertices.at n=2A006298
- An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=37A007333
- Expansion of g.f. 1/((1-x)*(1-2*x)*(1-5*x)).at n=5A016198
- a(n) = (n+1)*binomial(n+6,6).at n=6A027818
- a(n) = 77*(n+1)*binomial(n+6,11).at n=1A027823
- Four times pentagonal numbers: a(n) = 2*n*(3*n-1).at n=33A033579
- Triangle read by rows giving number of ways to glue sides of a 2n-gon so as to produce a surface of genus g.at n=14A035309
- a(n) = n*binomial(2*n-2, n-1).at n=7A037965
- Numbers n such that there are equal numbers of 0's and 1's in first n digits of binary representation of Pi.at n=22A039624
- a(n) = A026301(n)/2^n.at n=5A046105
- Denominators of coefficients in Stirling's expansion for log(Gamma(z)).at n=24A046969
- a(n) = C(n)*(8*n+1) where C(n) = Catalan numbers (A000108).at n=6A050478
- Numbers k such that sopfr(k) = sopfr(k + sopfr(k)).at n=14A050780
- (n - phi(n)) | sigma(n) for composite n not congruent to 2 (mod 4).at n=19A055164
- Numbers k such that k | sigma_7(k) - phi(k)^7.at n=12A055701
- Digits composite, each digit minus 1 is prime, sum of digits minus 1 is prime, difference of digits (in absolute value) minus 1 is prime.at n=27A058229
- Coefficient triangle of certain polynomials N(5; m,x).at n=34A062190
- Numbers k such that prime(k+2)-(k+2)*tau(k+2) = prime(k-2)-(k-2)*tau(k-2) where tau(k) = A000005(k) is the number of divisors of k.at n=19A067354
- Numbers n such that sigma(n) = 4*(n-phi(n)).at n=8A068420