6529
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
- 2
- Divisor Sum
- 6530
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 6528
- Möbius Function
- -1
- Radical
- 6529
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 168
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 844
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Largest primitive factor of 2^(2n+1) + 1.at n=25A002589
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/22 ).at n=21A011932
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).at n=25A024686
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).at n=24A025119
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 60 ones.at n=7A031828
- Lower prime of a difference of 18 between consecutive primes.at n=24A031936
- Multiplicity of highest weight (or singular) vectors associated with character chi_178 of Monster module.at n=38A034566
- Least prime in A031936 (lesser of 18-twins) whose distance to the next 18-twin is 2*n.at n=17A052358
- Primes p whose period of reciprocal equals (p-1)/6.at n=42A056211
- Numbers k such that 50*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=12A056687
- Numbers k such that k*2^m+1 is prime for exactly one exponent m in the range 0<=m<=k.at n=46A061155
- a(n) = A064842(n)/2.at n=33A064843
- Smallest m such that A065623(m) = n.at n=24A065624
- The first of two consecutive primes with equal digital sums.at n=17A066540
- Primes containing 2k digits in which the sum of the first k digits is that of the last k digits.at n=40A068896
- Partial sums of usigma(n)^2: square of the sum of unitary divisors of n.at n=20A074789
- Smallest primes such that a(j) - a(k) are all different.at n=39A079848
- Proth primes: primes of the form k*2^m + 1 with odd k < 2^m, m >= 1.at n=29A080076
- a(1) = 1, then the smallest prime divisor of A065447(n) not included earlier.at n=32A087552
- a(1) = 1; then primes associated with A091850.at n=25A091851