6650
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 14880
- Proper Divisor Sum (Aliquot Sum)
- 8230
- 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
- 2160
- Möbius Function
- 0
- Radical
- 1330
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 137
- 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
- a(n) = n*(17*n - 1)/2.at n=28A022274
- a(n) = A027113(n, 2n-4).at n=8A027122
- Number of partitions of n into parts not of the form 15k, 15k+6 or 15k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=33A035960
- Numbers whose base-9 representation has exactly 5 runs.at n=7A043634
- A convolution triangle of numbers obtained from A034687.at n=42A049375
- Coefficients of the '6th-order' mock theta function rho(q).at n=43A053270
- First of 3 consecutive numbers which are cubefree and not squarefree, i.e., numbers k such that {k, k+1, k+2} are in A067259.at n=33A071319
- Stirling2 triangle with scaled diagonals (powers of 5).at n=33A075500
- Sixth column of triangle A075500.at n=2A075914
- Numbers k such that the sum of primes dividing k (with repetition) / smallest prime dividing k = largest prime dividing k.at n=39A085702
- Row sums of Clark's triangle A046902.at n=10A100206
- Shadow of Pi.at n=35A110621
- Numbers k such that there is a bigger number m satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=23A124140
- Retrograde trajectory of 13 under map n -> A132948(n).at n=34A132947
- Row sums of triangle A134480.at n=19A134481
- Numbers k such that k and k^2 use only the digits 0, 2, 4, 5 and 6.at n=41A136898
- Binomial transform of [1, 5, 10, 10, 5, 1, 1, -1, 1, -1, 1, ...].at n=12A140228
- a(n) = floor(2*(3/2)^n).at n=20A147788
- 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, 0), (-1, 0, -1), (0, 0, 1), (1, -1, 0), (1, 1, 1)}.at n=7A150455
- 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, 0), (-1, 1, -1), (0, 1, 0), (1, 0, -1), (1, 1, 1)}.at n=7A150456