5257
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6016
- Proper Divisor Sum (Aliquot Sum)
- 759
- 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
- 4500
- Möbius Function
- 1
- Radical
- 5257
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 178
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numerators of coefficients for numerical integration.at n=7A002208
- Oscillates under partition transform.at n=44A007210
- Coordination sequence T2 for Zeolite Code MFI.at n=46A008165
- Number of partitions of n into divisors of n.at n=65A018818
- Pseudoprimes to base 72.at n=25A020200
- Pseudoprimes to base 73.at n=47A020201
- Strong pseudoprimes to base 72.at n=10A020298
- Strong pseudoprimes to base 73.at n=9A020299
- Numbers k such that the continued fraction for sqrt(k) has period 74.at n=10A020413
- Fibonacci sequence beginning 1, 8.at n=15A022098
- Numbers k such that Fib(k) == 13 (mod k).at n=29A023178
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=39A024834
- a(n) = Sum_{k=n..2*n} T(n,k), T given by A027052.at n=9A027067
- Numbers whose set of base-8 digits is {1,2}.at n=42A032929
- a(n) = 4*n^2 - 6*n + 3.at n=36A054569
- Composite and every divisor (except 1) contains the digit 7.at n=23A062676
- Number of partitions of n into unitary divisors of n.at n=65A066874
- Numbers k such that sigma(k^2+1) is a perfect square.at n=10A067465
- Multiples of 7 using only prime digits (2, 3, 5 and 7).at n=31A077536
- a(n) = 9*n^2 + 3*n + 1.at n=24A082040