6966
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
- 4
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 15972
- Proper Divisor Sum (Aliquot Sum)
- 9006
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2268
- Möbius Function
- 0
- Radical
- 258
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 88
- 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
- yes
- Odd
- no
Appears in sequences
- Even sequences with period 2n.at n=10A000206
- Number of unlabeled planar simple graphs with n nodes.at n=8A005470
- a(n) = floor( n*(n-1)*(n-2)/28 ).at n=59A011910
- Number of ordered quadruples of integers from [ 1,n ] with no common factors between triples.at n=21A015635
- Numbers having three 0's in base 9.at n=28A043455
- Numbers having three 6's in base 10.at n=32A043515
- 13-gonal (or tridecagonal) numbers: a(n) = n*(11*n - 9)/2.at n=36A051865
- Number of step cyclic shifted sequences using a maximum of six different symbols.at n=6A056414
- s=0; d is divisor of n [here d <= n/d]; if gcd(d,n/d)=1 or gcd(d,n/d)=d then s=s+d+(n/d); [if d=n/d then s=s+d]: The sequence contains composite n for which s = 2*n.at n=2A057246
- Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,3.at n=31A064238
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,15.at n=21A064244
- Numbers beginning and ending with their multiplicative digital root.at n=41A064704
- a(n) = (5*n+1)*(5*n+6).at n=16A085025
- Smallest number which can be expressed as the sum of its proper divisors in exactly n ways.at n=40A096356
- 6-almost primes with semiprime digits (digits 4, 6, 9 only).at n=5A111730
- Triangle read by rows: T(n,k) is the number of hill-free Schroeder paths of length 2n that have k weak ascents (1<=k<=n-1 for n>=2; k=1 for n=1). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A hill is a peak at height 1. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.at n=25A114691
- Numbers k such that the digits of k^3, reversed, include the digits of k as substring.at n=14A115762
- a(n) is the smallest number m such that the sum of the digits of n+m is n.at n=32A130692
- a(n) = A131668(n) - (2*n+1).at n=16A131766
- Number of line segments connecting exactly 10 points in an n x n grid of points.at n=35A177726