5275
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
- 6
- Divisor Sum
- 6572
- Proper Divisor Sum (Aliquot Sum)
- 1297
- 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
- 4200
- Möbius Function
- 0
- Radical
- 1055
- Omega Function (Ω)
- 3
- 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
- 103
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence T2 for Zeolite Code VSV.at n=46A009915
- Number of subgroups of index n in fundamental group of a certain fiber space.at n=3A027840
- Duplicate of A027840.at n=3A027843
- Binomial transform of Fine's sequence A000957: 1, 0, 1, 2, 6, 18, 57, 186, ...at n=8A033321
- Numerators of continued fraction convergents to sqrt(540).at n=4A042032
- a(n) = floor(A*a(n-1) + B*a(n-2) + C)/p^r, where p^r is the highest power of p dividing floor(A*a(n-1) + B*a(n-2) + C), A=1.0001, B=1.0001, C=1, p=2.at n=22A053521
- Matrix inverse of A008459 (squares of entries of Pascal's triangle).at n=16A055133
- Number of base-5 (n+1)-digit numbers starting with a zero and with adjacent digits differing by one or less.at n=9A057960
- Composite numbers k such that the sum of the proper divisors of k not including 1, (Chowla's function, A048050) and their product (A007956) are both perfect squares.at n=18A064180
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) both are divisible by n, or 0 if n is divisible by 10.at n=24A075606
- Average of four successive primes squared, (prime(n)^2 + prime(n+1)^2 + prime(n+2)^2 + prime(n+3)^2)/4, n>=2.at n=17A075894
- a(n) = A063997(n)/4.at n=21A088406
- Expansion of g.f. (1 + x + 2*x^2)/((1 - x)^3*(1 - x^3)).at n=27A092498
- Numbers n such that 101101 * 10^n + 1 is prime.at n=14A106745
- Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0) = 1, T(n,k) = 0 if n<k, T(n,0) = T(n-1,0) + T(n-1,1) and for k >= 1: T(n,k) = T(n-1,k-1) + x*T(n-1,k) + T(n-1,k+1) with x = 3.at n=36A110877
- a(2*n+1) = 5*a(n), a(2*n+2) = 6*a(n) + a(n-1).at n=43A116553
- Start with 1 and repeatedly reverse the digits and add 74 to get the next term.at n=36A118225
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having height of the last peak equal to k (1 <= k <= n).at n=36A128745
- Main diagonal of array A[k,n] = n-th sum of k consecutive k-gonal numbers, k>2.at n=7A130424
- Numbers k such that k and k^2 use only the digits 2, 5, 6, 7 and 8.at n=17A137111