5610
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 15552
- Proper Divisor Sum (Aliquot Sum)
- 9942
- 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
- 1280
- Möbius Function
- -1
- Radical
- 5610
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 85
- 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
- a(n+1) = 1 + a( floor(n/1) ) + a( floor(n/2) ) + ... + a( floor(n/n) ).at n=34A003318
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=32A003452
- Second-order Eulerian numbers <<n,2>>.at n=5A004301
- Coordination sequence T3 for Zeolite Code DOH.at n=46A008080
- Second-order Eulerian triangle T(n,k), 1 <= k <= n.at n=23A008517
- a(n) = floor(n*(n-1)*(n-2)/7).at n=35A011889
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 5.at n=21A013593
- Powers of fifth root of 11 rounded down.at n=18A018144
- Areas of right triangles with coprime integer sides.at n=31A024365
- Ordered areas of primitive Pythagorean triangles.at n=33A024406
- a(n) = (d(n)-r(n))/2, where d = A026046 and r is the periodic sequence with fundamental period (0,1,0,1).at n=28A026047
- Theta series of 6-dimensional 8-modular lattice of minimal norm 4.at n=32A029713
- Numbers whose set of base-7 digits is {2,3}.at n=33A032807
- Number of partitions in parts not of the form 11k, 11k+1 or 11k-1. Also number of partitions with no part of size 1 and differences between parts at distance 4 are greater than 1.at n=42A035944
- Sparsely totient numbers; numbers n such that m > n implies phi(m) > phi(n).at n=39A036913
- Nextprime(2^0)*nextprime(2^1)*nextprime(2^2)*...*nextprime(2^n).at n=4A038696
- Products of exactly 5 distinct primes.at n=6A046387
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A048149.at n=21A049712
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y.at n=12A050789
- Numbers that are divisible by exactly 5 different primes.at n=8A051270