2965
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3564
- Proper Divisor Sum (Aliquot Sum)
- 599
- 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
- 2368
- Möbius Function
- 1
- Radical
- 2965
- 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
- 48
- Smith Number
- yes
- 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
- Centered square numbers: a(n) = 2*n*(n+1)+1. Sums of two consecutive squares. Also, consider all Pythagorean triples (X, Y, Z=Y+1) ordered by increasing Z; then sequence gives Z values.at n=38A001844
- Coordination sequence T6 for Zeolite Code EUO.at n=34A008101
- Coordination sequence T1 for Zeolite Code ATO.at n=36A008265
- Pseudoprimes to base 77.at n=19A020205
- Strong pseudoprimes to base 77.at n=3A020303
- Numbers k such that the continued fraction for sqrt(k) has period 41.at n=2A020380
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6,..., 1/2n} satisfy r < s, then r < k/m < s for some integer k.at n=43A024820
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=41A024833
- 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+3)/m < s for some integer k.at n=20A024844
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = (primes).at n=47A025077
- Decimal part of a(n)^(1/2) starts with reversal of its integer part: first term of runs.at n=38A034308
- Numbers k such that d(i) is a power of 2 for all k <= i <= k+6, where d(i) = number of divisors of i.at n=46A036540
- Odd composite numbers n such that the digit sum of n equals digit sum of sum of its prime factors (counted with multiplicity).at n=36A036923
- Digit sum of 'odd' number equals digit sum of 'sum' and 'juxtaposition' of its prime factors (counted with multiplicity).at n=22A036927
- Numbers n such that string 6,5 occurs in the base 10 representation of n but not of n-1.at n=32A044397
- Numbers n such that string 6,5 occurs in the base 10 representation of n but not of n+1.at n=32A044778
- Larger of Smith brothers.at n=1A050220
- Numbers n such that 237*2^n-1 is prime.at n=28A050877
- a(n) = Sum_{k=1..n} C(n, floor(n/k)).at n=13A051054
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 17.at n=2A051982