3265
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3924
- Proper Divisor Sum (Aliquot Sum)
- 659
- 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
- 2608
- Möbius Function
- 1
- Radical
- 3265
- 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
- 136
- 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
- Expansion of tanh(tan(x))/cos(x).at n=4A009813
- Numbers k such that the continued fraction for sqrt(k) has period 31.at n=12A020370
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-6).at n=20A023436
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 3.at n=44A031416
- Numbers whose base-5 representation has exactly 6 runs.at n=8A043606
- Numbers n such that string 6,5 occurs in the base 10 representation of n but not of n-1.at n=35A044397
- Numbers n such that string 6,5 occurs in the base 10 representation of n but not of n+1.at n=35A044778
- Numbers whose base-5 representation contains exactly three 0's and two 1's.at n=26A045171
- Numbers whose base-5 representation contains exactly three 0's and one 3.at n=44A045200
- Number of partitions of n into distinct summands (A000009), plus 1 (apart from the first term).at n=49A052839
- Composite and every divisor (except 1) contains the digit 5.at n=29A062672
- Composite n such that the sums of the composite numbers up to n, +/- 1, are twin primes.at n=24A065022
- Numbers n such that phi(phi(n)) = phi(sigma(n)) where phi is Euler's totient and sigma is the multiplicative sum-of-divisors function.at n=32A065555
- Binary representation of base-(i-1) expansion of n: replace i-1 with 2 in base-(i-1) expansion of n.at n=25A066321
- Centered 24-gonal numbers.at n=16A069190
- Odd interprimes not divisible by 3.at n=34A072573
- Interprimes which are of the form s*prime, s=5.at n=7A075280
- a(n+1) = a(n)+greatest prime divisor of a(n-1).at n=33A078695
- Least k such that the decimal representation of k*n contains only 1's and 0's.at n=33A079339
- Least k such that decimal representation of k*n contains only digits 0 and 5.at n=16A096684