5700
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
- 36
- Divisor Sum
- 17360
- Proper Divisor Sum (Aliquot Sum)
- 11660
- 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
- 1440
- Möbius Function
- 0
- Radical
- 570
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 28
- 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
- a(n) = 2*n*(2*n-1).at n=38A002939
- Specific heat coefficients for square lattice spin 5/2 Ising model.at n=20A010114
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor((n+1)/2).at n=37A024305
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k=[ (n+1)/2 ], s = (natural numbers >= 2), t = (natural numbers >= 3).at n=36A024306
- Perimeters of more than one primitive Pythagorean triangle.at n=6A024408
- a(n) = (-1 + prime(n+1)^2)/4.at n=34A024701
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor(n/2).at n=36A024868
- (d(n)-r(n))/2, where d = A008778 and r is the periodic sequence with fundamental period (1,1,0,1).at n=37A026052
- Triangle of the square of the normalized, unsigned Stirling matrix of the first kind.at n=11A027477
- Second column of triangle A027477, constructed from the Stirling numbers of the first kind.at n=3A027487
- Numbers k such that k^2 is palindromic in base 14.at n=22A030072
- Numbers whose set of base-14 digits is {1,2}.at n=23A032934
- Schoenheim bound L_1(n,5,4).at n=25A036832
- Base-7 palindromes that start with 2.at n=34A043016
- Numbers whose base-7 representation contains exactly four 2's.at n=19A043404
- Hexagonal matchstick numbers: a(n) = 3*n*(3*n+1).at n=25A045945
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x.at n=24A050792
- Numbers k such that phi(x) = k has exactly 9 solutions.at n=29A060672
- Number of connected labeled graphs with n nodes and n+1 edges.at n=5A061540
- Triangular array T(n,k) giving number of connected graphs with n labeled nodes and k edges (n >= 1, 0 <= k <= n(n-1)/2).at n=32A062734