5100
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 15624
- Proper Divisor Sum (Aliquot Sum)
- 10524
- 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
- 0
- Radical
- 510
- 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
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 85
- 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
- The coding-theoretic function A(n,4,4).at n=47A001843
- Squares written in base 7.at n=41A002440
- Expansion of Product (1 - x^k)^10 in powers of x.at n=29A010818
- a(n) = n*(n+1)*(2*n+1)*(3*n+1)/6.at n=8A011195
- a(n) = floor( n*(n-1)*(n-2)/26 ).at n=52A011908
- a(n) = 4*n*(2*n + 1).at n=25A033586
- Conjecturally, a power of 2 written in base 3 cannot have this many 0's.at n=43A036462
- Base-9 palindromes that start with 6.at n=19A043033
- Numbers whose base-3 representation contains exactly two 0's and no 1's.at n=40A044975
- Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n-3)/3.at n=22A048034
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.at n=15A049907
- Composites whose sum of digits equals number of its prime factors, with multiplicity.at n=29A050689
- Molien series for group G_{1,2}^{8} of order 1536.at n=22A051462
- Values of B (the even leg) of a Pythagorean triangle with A and C both prime and part of a twin prime.at n=5A051858
- a(n) = 2*n * Stirling2(n-1,2).at n=10A052749
- Integers that can be expressed as the sum of consecutive primes in exactly 4 ways.at n=20A054999
- Number of primitive (period n) n-bead necklaces with exactly four different colored beads.at n=7A056289
- Numbers k that can be expressed as k = w + x = y*z with w*x = y^3 + z^3 where w, x, y, and z are all positive integers.at n=21A057372
- Triangle T(n,k), n >= 1, giving number of prime unoriented alternating links with n crossings and k components.at n=39A059739
- Prime unoriented alternating links with n crossings and 2 components.at n=12A059741