6504
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
- 16
- Divisor Sum
- 16320
- Proper Divisor Sum (Aliquot Sum)
- 9816
- 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
- 2160
- Möbius Function
- 0
- Radical
- 1626
- Omega Function (Ω)
- 5
- 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
- 44
- 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
- Coordination sequence for FeS2-Pyrite, Fe position.at n=37A009957
- a(n) = Sum_{k=1..n} (n-k) * floor(n/k).at n=44A024920
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 19 (most significant digit on left).at n=33A029488
- Denominators of continued fraction convergents to sqrt(510).at n=11A041975
- Integers that can be expressed as the sum of consecutive primes in exactly 4 ways.at n=24A054999
- Numbers k such that phi(x) = k has exactly 7 solutions.at n=36A060670
- Integers expressible as the sum of (at least two) consecutive primes in at least 4 ways.at n=16A067374
- Partial sums of A068058 + 1.at n=33A068059
- Numbers k such that the number of distinct primes dividing k = number of anti-divisors of k.at n=40A073713
- Positive numbers k such that the number of primes between k and 2*k is different from the number of primes between m and 2*m for every number m != k.at n=41A084142
- Number of configurations of the 3-dimensional 3 X 3 X 3 sliding cube puzzle that require a minimum of n moves to be reached, starting with the empty space in the center of the combination cube.at n=7A090574
- Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 001 (n,k>=0).at n=42A118424
- a(n) = A000010(n) * A002088(n).at n=41A143231
- The number of degree sequences with degree sum 2n representable by a non-separable graph (with multiple edges allowed).at n=20A147877
- Numbers k such that k^2 == 2 (mod 23^2).at n=24A156849
- a(n) = 1728*n - 408.at n=3A157266
- G.f.: Sum_{n>=0} A155585(2n+1)*log(1-2x)^n/n!, where (1-2*x)^2/(1-2*x+2*x^2) = Sum_{n>=0} A155585(n)*log(1-2x)^n/n!.at n=4A167540
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=43A181881
- Number of kites on an n X n grid (or geoboard).at n=8A189417
- Number of lower triangles of a 4 X 4 0..n array with each element differing from all of its horizontal and vertical neighbors by one.at n=31A195000