5057
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5460
- Proper Divisor Sum (Aliquot Sum)
- 403
- 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
- 4656
- Möbius Function
- 1
- Radical
- 5057
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 72
- 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
- a(n) = floor(n*phi^14), where phi is the golden ratio, A001622.at n=6A004929
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13).at n=39A017844
- a(n) = n*(15*n - 1)/2.at n=26A022272
- a(n) = dot_product(1,2,...,n)*(5,6,...,n,1,2,3,4).at n=21A026043
- Denominators of continued fraction convergents to sqrt(694).at n=11A042335
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049735.at n=20A049737
- a(n)=T(n,3), array T as in A049735.at n=40A049746
- a(n) = a(n-1) + a(n-1 minus the number of terms of the same parity as n so far).at n=47A060714
- Number of partitions of n in which the sequence of frequencies of the summands is nonincreasing.at n=50A100882
- a(n) = 1 + 2 * least i such that A103509(i)=n+1, 0 if no such i exists.at n=25A103510
- Number of squares in an n X n grid of squares with diagonals.at n=16A111500
- Numbers k such that sigma(k) and phi(k) are both triangular numbers.at n=6A113930
- a(n) = prime(n) + n!.at n=6A121926
- Numbers with at least two digits in which all digits except the rightmost are 0 or 5 and the rightmost is neither 0 nor 5.at n=37A144162
- a(n) = 8 - 12*n + 5*n^2.at n=32A145995
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 1, -1), (1, -1, 1), (1, 1, 1)}.at n=7A149631
- Positive numbers y such that y^2 is of the form x^2+(x+833)^2 with integer x.at n=23A156835
- Number of partitions of n with distinct occurrences of parts.at n=42A166239
- Primes in carryless arithmetic mod 10 in which all digits except the rightmost are zero or five.at n=14A169984
- a(1)=1, a(2)=3; for n>=3, a(n) is the smallest number larger than a(n-1) such that, for every k<n, a(n) is relatively prime to a(k) iff n is relatively prime to k.at n=48A172980