5635
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
- 12
- Divisor Sum
- 8208
- Proper Divisor Sum (Aliquot Sum)
- 2573
- 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
- 3696
- Möbius Function
- 0
- Radical
- 805
- 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
- no
- 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
- no
- Odd
- yes
Appears in sequences
- G.f.: (1 + x^4 + x^7 + 2*x^8 + x^9 + x^12 + x^16)/Product_{i=1..8} (1 - x^i).at n=29A003405
- Number of restricted 3 X 3 matrices with row and column sums n.at n=38A005045
- Sequence satisfies T^2(a)=a, where T is defined below.at n=50A027594
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 15.at n=37A031513
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 15.at n=4A031693
- a(n) = Sum_{i=0..n} A047060(i,n-i).at n=14A047061
- Second 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n+7)/2.at n=35A062728
- Product(n/k - k) where the product is over the divisors k of n and where 1 <= k <= sqrt(n).at n=49A068333
- Composite numbers k with no prime factor among (2, 3) (cf. A038509) and such that phi(k) < 2*k/3.at n=20A069043
- Number of distinct factorizations of 105*2^n.at n=12A093802
- Row sums of triangle A096815, in which A096815(n,k) equals the k-th term of the convolution of the two prior rows indexed by (n-k) and k.at n=16A096816
- a(1) = 393; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1). edit.at n=35A105210
- Numbers k such that k^6+6 is prime.at n=26A109836
- a(1)=1. a(n) = a(n-1) + (largest integer occurring among {a(1),a(2),a(3),...,a(n-1)} that is coprime to n).at n=17A120939
- A bisection of A129095: a(n) = A129095(2n-1) for n>=1.at n=37A129096
- a(n) = 3*n^2 - 4*n + 3.at n=43A141631
- 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, 1, 1), (0, 1, -1), (1, 0, -1), (1, 1, 1)}.at n=7A149729
- a(n) = 225n^2 + 2n.at n=4A158228
- Numbers of the form 12n+7 for which Sum_{i=0..(4n+2)} J(i,12n+7) = 0, where J(i,m) is the Jacobi symbol.at n=17A165463
- Twin natural nonprimes with nonprime number of prime factors.at n=16A171995