3595
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4320
- Proper Divisor Sum (Aliquot Sum)
- 725
- 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
- 2872
- Möbius Function
- 1
- Radical
- 3595
- 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
- 69
- 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
- Partial sums of (unordered) ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=45A000064
- Numbers that are the sum of 12 positive 7th powers.at n=24A003379
- Partitioning integers to avoid arithmetic progressions of length 3.at n=19A006999
- Coordination sequence T2 for Scapolite.at n=38A008263
- Coordination sequence for tridymite, lonsdaleite, and wurtzite.at n=37A008264
- Cycle class sequence c(n) (number of true cycles of length n in which a certain node is included) for zeolite EUO = EU-1 Nan [ AlnSi112-n O224 ].at n=11A019120
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number) and d(n) = (n-th non-Fibonacci number).at n=16A023484
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (F(2), F(3), ...).at n=11A024589
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (F(2), F(3), F(4), ...).at n=10A025103
- Lucky numbers with size of gaps equal to 16 (upper terms).at n=11A031899
- Decimal part of a(n)^(1/2) starts with reversal of its integer part: first term of runs.at n=43A034308
- Multiplicity of highest weight (or singular) vectors associated with character chi_12 of Monster module.at n=37A034400
- Number of partitions in parts not of the form 15k, 15k+1 or 15k-1. Also number of partitions with no part of size 1 and differences between parts at distance 6 are greater than 1.at n=37A035955
- Base-4 palindromes that start with 3.at n=34A043005
- Numbers n such that string 9,5 occurs in the base 10 representation of n but not of n-1.at n=38A044427
- Numbers k such that string 9,5 occurs in the base 10 representation of k but not of k+1.at n=38A044808
- Integers m such that A064992(m) = A064992(m+1).at n=8A065002
- Numbers k such that (10^k - 1)/3 + 5*10^floor(k/2) is a palindromic wing prime (a.k.a. near-repdigit palindromic prime).at n=7A077792
- Least k such that k*P(n)#/2 - 4 and k*P(n)#/2 + 4 are consecutive primes with a gap of 8, where P(n)=n-th prime, P(n)#=n-th primorial.at n=49A097568
- Expansion of (1+2*x)/((1+x)*(1-x^2-x^3)).at n=31A098601