6535
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
- 4
- Divisor Sum
- 7848
- Proper Divisor Sum (Aliquot Sum)
- 1313
- 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
- 5224
- Möbius Function
- 1
- Radical
- 6535
- 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
- 137
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 68.at n=19A020407
- Convolution of A023532 and Lucas numbers.at n=16A023597
- Expansion of 1/((1-4x)(1-6x)(1-7x)(1-10x)).at n=3A028132
- Take list of cubes, move left digit of each term to end of previous term.at n=38A032761
- Number of primes between n*100000 and (n+1)*100000.at n=39A038825
- Numbers whose base-5 representation contains exactly two 0's and three 2's.at n=35A045183
- a(n) = (117*n^2 - 99*n + 2)/2.at n=11A050408
- Number of integers k such that phi(k) = 10^n.at n=20A072074
- Numbers n such that 8*10^n + 7*R_n + 2 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=14A103091
- Semiprimes (A001358) whose digit reversal is a triangular number.at n=28A115741
- a(0) = 3; for n > 0, break up decimal expansion of Pi into chunks of increasing lengths; leading zeros are not printed.at n=4A136517
- a(n) = 242*n + 1.at n=26A157958
- a(n) = 54*n^2 + 1.at n=11A158646
- Fourth row of A166091. Positions of 7's in A166086.at n=34A166056
- a(n) = (11*n^2 + 11*n - 20)/2.at n=33A166144
- a(n) = F(2*n)^3 - F(3*n-1)^2 - F(6*n-8).at n=4A171680
- Semiprimes in the order in which they appear in the decimal expansion of Pi.at n=21A226943
- a(n) = 6*n^2 + 1.at n=33A227776
- Number of partitions p of n such that (sum of parts with multiplicity 1) <= (sum of all other parts).at n=34A240449
- Consider a number of k digits n = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + … + d_(2)*10 + d_(1). Sequence lists the numbers n such that Sum_{i=1..k-1}{phi(Sum_{j=1..i}{d_(j)*10^(j-1)})} = Sum_{i=1..k-1}{sigma(Sum_{j=1..i}{d_(k-j+1)*10^(i-j)})} (see example below).at n=15A244069