6575
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 8184
- Proper Divisor Sum (Aliquot Sum)
- 1609
- 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
- 5240
- Möbius Function
- 0
- Radical
- 1315
- Omega Function (Ω)
- 3
- 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
- 75
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- 5th power of rooted tree enumerator; number of linear forests of 5 rooted trees.at n=7A000343
- a(n) = n*(21*n + 1)/2.at n=25A022279
- Number of days in n years (n=2 is the first leap year).at n=17A033173
- Number of days in n years (n=1 is the first leap year).at n=17A033174
- Number of n-node rooted identity trees of height 7.at n=9A038091
- A Diaconis-Mosteller approximation to the Birthday problem function.at n=31A050255
- n*10^2-1, n*10^2-3, n*10^2-7 and n*10^2-9 are all prime.at n=11A064976
- Sum of the products of the first n prime pairs.at n=7A135232
- Integers of the form 4n+3 for which Sum_{i=1..u} J(i,4n+3) obtains value zero exactly 9 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol.at n=19A166059
- Numbers k such that 2^k-61 is prime.at n=29A182156
- Number of strings of numbers x(i=1..n) in 0..n with sum i*x(i) equal to n^2.at n=6A184695
- Number of strings of numbers x(i=1..n) in 0..7 with sum i*x(i) equal to n*7.at n=6A184701
- Number of strings of numbers x(i=1..7) in 0..n with sum i*x(i) equal to n*7.at n=6A184707
- Numbers 1 through 10000 sorted lexicographically in ternary representation.at n=27A190128
- Numbers congruent to 3 in the structure (or curve) of A211000.at n=28A211002
- Number of stacks of n triangles, pointing upwards or downwards depending on row parity.at n=16A224704
- Smallest m such that A070965(m) = n.at n=23A227953
- Products of 3 evil primes (A027699) p,q,r, such that numbers p*q, p*r, q*r, and p*q*r are odious (A000069).at n=6A230353
- a(n) = (2*n-1)^2 + 14.at n=40A242412
- Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 7.at n=12A252247