6560
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 15876
- Proper Divisor Sum (Aliquot Sum)
- 9316
- 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
- 2560
- Möbius Function
- 0
- Radical
- 410
- Omega Function (Ω)
- 7
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 31
- 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
- Aliquot sequence starting at 180.at n=41A008891
- Magic numbers: atoms with full shells containing any of these numbers of electrons are considered electronically stable.at n=31A018227
- Plaindromes: numbers whose digits in base 3 are in nondecreasing order.at n=44A023745
- a(n) = 3^n - 1.at n=8A024023
- a(n) = 9^n-1.at n=4A024101
- a(n+1) = smallest number not containing any digits of a(n), working in base 3.at n=16A030439
- Positions of the incrementally largest terms in the continued fraction for Laplace's limit constant.at n=6A033263
- 8 times triangular numbers: a(n) = 4*n*(n+1).at n=40A033996
- Numbers whose maximal base-9 run length is 4.at n=7A037999
- Base-9 palindromes that start with 8.at n=19A043035
- Numbers having four 8's in base 9.at n=0A043488
- Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 8.at n=15A043799
- Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 9.at n=15A043807
- Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 10.at n=15A043816
- Numbers that are repdigits in base 3.at n=16A048328
- Numbers that are repdigits in base 9.at n=32A048334
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x.at n=30A050788
- Values of n^2 - 1 resulting from A050795.at n=8A050799
- Number of ways to color vertices of a pentagon using <= n colors, allowing only rotations.at n=8A054620
- Number of n-bead necklaces with 8 colors.at n=5A054627