5560
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 12600
- Proper Divisor Sum (Aliquot Sum)
- 7040
- 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
- 2208
- Möbius Function
- 0
- Radical
- 1390
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 129
- 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 partitions of n into parts not of the form 11k, 11k+2 or 11k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 4 are greater than 1.at n=38A035945
- Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity).at n=15A039752
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=29A039849
- Base-9 palindromes that start with 7.at n=16A043034
- Number of nonisomorphic self-complementary circulant digraphs (Cayley digraphs for the cyclic group) of order 2n-1.at n=17A049309
- Numbers k that, when expressed in base 4 and then interpreted in base 8, give a multiple of k.at n=38A062923
- Numbers k such that sopfr(k) = sopf(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=10A064675
- A certain class of stable matchings.at n=12A069156
- Position of A051912 in A093110. a(n) is the number of integers < A051912(n) that can be expressed as a sum of three terms from A051912.at n=33A093111
- Formed from a secondary diagonal of triangle A096542 where a(n) = A096542(n,n-2)/3.at n=5A096543
- Structured snub cubic numbers.at n=9A100150
- Number of ways of arranging 2n tokens in a row, with 2 copies of each token from 1 through n, such that the first token is a 1 and between every pair of tokens labeled i (i=1..n) there is exactly one taken labeled (i+1 mod n).at n=5A117514
- Number of base 20 n-digit numbers with adjacent digits differing by three or less.at n=4A126488
- The sum of the principal diagonals of an n X n spiral.at n=20A137930
- Sum of the principal diagonals of a 2n X 2n square spiral.at n=10A137931
- a(n) = (p(n)*p(n+2) - p(n+1))/2, where p(n) is the n-th odd prime.at n=25A152531
- Main diagonal of array in A163280.at n=39A164000
- Numbers k such that k and k + 2 are both divisible by exactly five primes (counted with multiplicity).at n=42A180151
- Triangle read by rows: T(n,k) is the number of unordered pairs of nodes at distance k in the binomial tree of order n (1 <= k <= 2n-1; entries in row n are the coefficients of the corresponding Wiener polynomial).at n=56A192020
- For n >= 3, draw a regular n-sided polygon and its n(n-3)/2 diagonals, so there are n(n-1)/2 lines; a(n) is the number of ways to choose a subset of these lines (subsets differing by a rotation are regarded as identical). a(1)=1, a(2)=2 by convention.at n=5A192332