5372
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 4708
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2496
- Möbius Function
- 0
- Radical
- 2686
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 98
- 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
- Coordination sequence T4 for Zeolite Code MEL.at n=47A008153
- a(n) = least 2k such that p is the least prime in a Goldbach partition of 2k, where p = prime(n).at n=33A025017
- Numbers k such that least prime in the Goldbach partition of k increases.at n=10A025018
- "AGK" (ordered, elements, unlabeled) transform of 2,2,2,2...at n=11A032023
- Number of partitions of n into parts not of the form 13k, 13k+5 or 13k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=33A035953
- Number of partitions satisfying cn(2,5) + cn(3,5) < cn(0,5) + cn(1,5) + cn(4,5).at n=31A039869
- First term in the continued fraction expansion of StieltjesGamma[n].at n=57A066035
- Sum of terms in n-th group in A075352.at n=35A075356
- Multiples of 4 using only prime digits (2, 3, 5 and 7).at n=44A077534
- a(n) = sum of the first n lower twin primes.at n=25A086167
- Main diagonal of triangle A092565, in which the n-th row polynomial equals the numerator of the n-th convergent of the continued fraction [1 + x + x^2; 1 + x + x^2, 1 + x + x^2, ...].at n=9A092566
- a(2*k-1) = (2*k-1)^2 + 2 - k, a(2*k) = 6*k^2 + 2 - k: First column of the triangle A093915.at n=59A093916
- Least linear combinations of phi(n) and sigma(n) are multiple.at n=45A094702
- Numbers n such that n^2+n+41 (Euler's "prime generating polynomial") is not squarefree.at n=31A097823
- The arithmetic mean of the n-th and (n+1)-st cubes, rounded down.at n=17A147656
- a(n) is the least even number such that if p_i is the i-th prime then a(n)-p_i, i=1..n, are composite numbers.at n=30A152522
- a(n) is the least even number such that if p_i is the i-th prime then a(n)-p_i, i=1..n, are composite numbers.at n=29A152522
- a(n) is the least even number such that if p_i is the i-th prime then a(n)-p_i, i=1..n, are composite numbers.at n=28A152522
- a(n) is the least even number such that if p_i is the i-th prime then a(n)-p_i, i=1..n, are composite numbers.at n=27A152522
- a(n) is the least even number such that if p_i is the i-th prime then a(n)-p_i, i=1..n, are composite numbers.at n=26A152522