6607
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6608
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 6606
- Möbius Function
- -1
- Radical
- 6607
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 854
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of forests with n nodes and height at most 2.at n=6A000949
- Where the prime race among 5k+1, ..., 5k+4 changes leader.at n=38A007353
- Numbers k such that the continued fraction for sqrt(k) has period 76.at n=10A020415
- Primes that remain prime through 3 iterations of function f(x) = 4x + 3.at n=20A023281
- Primes that remain prime through 4 iterations of function f(x) = 4x + 3.at n=3A023311
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence).at n=21A024689
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A001950 (upper Wythoff sequence).at n=20A025122
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 1, -1, 1, 1.at n=22A025258
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 81.at n=3A031579
- Dirichlet convolution of 3^(n-1) with primes (with 1).at n=8A034752
- a(n) = T(2n-1,n), array T given by A048225.at n=43A048234
- Least prime in A031930 (lesser of 12-twins) whose distance to the next 12-twin is 2*n.at n=21A052355
- Numbers k such that 2*3^k + 35 is prime.at n=34A059768
- Primes that are the sum of five consecutive composite numbers.at n=43A060330
- a(n) = floor(9^n/7^n).at n=35A094991
- Number of compositions of n where the smallest part is greater than the number of parts.at n=43A098132
- Primes in A103374.at n=17A103384
- Primes one less than the sum over a sexy prime pair.at n=46A104227
- Primes from merging of 4 successive digits in decimal expansion of cos(1).at n=2A104960
- Sum of the right diagonal in ordered 3 X 3 prime squares.at n=36A105091