6953
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
- 4
- Divisor Sum
- 7380
- Proper Divisor Sum (Aliquot Sum)
- 427
- 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
- 6953
- 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
- 88
- 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
- Pseudoprimes to base 66.at n=25A020194
- Strong pseudoprimes to base 66.at n=7A020292
- Numbers k such that k! is divisible by the square of (f+d)!^2 for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2).at n=37A056068
- Numbers k such that 2*7^k + 5 is prime.at n=15A059042
- a(n) is the number of solutions to x+y+z = 0 mod 3, where 1 <= x < y < z <= n.at n=51A061866
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 4.at n=7A094827
- Numbers in base 10 that are palindromic in bases 7 and 8.at n=13A099145
- Structured triakis tetrahedral numbers (vertex structure 4).at n=16A100175
- Number of distinct ways to dissect a square into n rectangles of equal area.at n=8A108066
- a(n) = (2^(semiprime(n)-1)) modulo (semiprime(n)^2).at n=39A115948
- The values of c in a^2 + b^2 = c^2 where b - a = 23 and gcd(a,b,c) = 1.at n=6A117475
- Binomial transform of A128046.at n=25A128047
- Positive numbers y such that y^2 is of the form x^2+(x+23)^2 with integer x.at n=11A156567
- a(n) = 6*a(n-1)-a(n-2) for n > 2; a(1)=37, a(2)=205.at n=3A156569
- a(n) = 169*n^2 + 140*n + 29.at n=6A156640
- Hypotenuses c of primitive Pythagorean Triples (a,b,c) such that 2*a+1, 2*b+1 and 2*c+1 are primes.at n=20A165238
- Numbers that are 5-digit palindromes in at least two bases.at n=5A180454
- Product of exactly two distinct primes congruent to 1 mod 8 (A007519).at n=21A185377
- Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3, p_4} = {-3,0,1,2}, n=3*r+p_i, and define a(-3)=1. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,1,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(2*cos(Pi/9)).at n=53A187495
- Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3, p_4} = {-3,0,1,2}, n=3*r+p_i, and define a(-3)=0. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,2,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(2*cos(Pi/9)).at n=50A187496