6957
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 10062
- Proper Divisor Sum (Aliquot Sum)
- 3105
- 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
- 4632
- Möbius Function
- 0
- Radical
- 2319
- 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
- 57
- 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
- Numbers k such that Fib(k) == -34 (mod k).at n=41A023169
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=38A024846
- Numbers whose set of base-13 digits is {2,3}.at n=22A032813
- Number of primes between n*100000 and (n+1)*100000.at n=18A038825
- Numerators of continued fraction convergents to sqrt(869).at n=5A042678
- Number of partitions of primes into mutual coprimes > 1.at n=30A086191
- Numbers k such that 216*k+108 is a term of A097703 and A007494 and A098240.at n=7A098241
- Perfect Abs: Imaginary part of complex z such that Abs[(Total[Divisors[z]]-z)]=Abs[z].at n=24A101366
- a(n) = k*a(n-1) + a(n-2) where k = A003842(a); a(0) = 1.at n=14A108282
- Terms in A112039 that are divisible by 3, divided by 3.at n=17A112040
- Starting with 1, each number is the previous number plus the product of the index number and the sum of the digits of the previous number.at n=29A113904
- Numbers of the form 68+p^2 (where p is a prime).at n=22A138691
- Partial sums of A002522, starting at n=1.at n=26A145066
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 11011-01110-00100 pattern in any orientation.at n=14A147483
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (-1, 0, 1), (0, -1, 1), (1, 1, 0)}.at n=8A149245
- a(n) = Sum_{i=1..Fibonacci(n)} sigma_0(i) where sigma_0(n) is A000005(n).at n=15A158568
- Number of binary strings of length n with no substrings equal to 0001 0110 or 1011.at n=14A164479
- A175366(n^2).at n=35A175367
- Ascending sequence of numbers such that the sum of any two distinct elements (even + odd) is a prime number.at n=26A180743
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant in {-1,0,1}.at n=26A209993