607
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 608
- 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
- 606
- Möbius Function
- -1
- Radical
- 607
- 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
- 43
- Smith 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
- 111
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- sechshundertsieben· ordinal: sechshundertsiebenste
- English
- six hundred seven· ordinal: six hundred seventh
- Spanish
- seiscientos siete· ordinal: 607º
- French
- six cent sept· ordinal: six cent septième
- Italian
- seicentosette· ordinal: 607º
- Latin
- sescenti septem· ordinal: 607.
- Portuguese
- seiscentos e sete· ordinal: 607º
Appears in sequences
- Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime.at n=13A000043
- Number of primitive n-bead necklaces (turning over is allowed) where complements are equivalent.at n=15A000046
- Primes that divide at least one term in every Fibonacci sequence.at n=24A000057
- Number of trees of diameter 4.at n=20A000094
- Number of graphical partitions of 2n.at n=11A000569
- Numbers beginning with letter 's' in English.at n=31A000870
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=10A000923
- Irregular primes: primes p such that at least one of the numerators of the Bernoulli numbers B_2, B_4, ..., B_{p-3} (A000367) is divisible by p.at n=35A000928
- Primes with 3 as smallest primitive root.at n=25A001123
- Degrees of primitive irreducible trinomials: n such that 2^n - 1 is a Mersenne prime and x^n + x^k + 1 is a primitive irreducible polynomial over GF(2) for some k with 0 < k < n.at n=9A001153
- Number of stacks, or arrangements of n pennies in contiguous rows, each touching 2 in row below.at n=19A001524
- Prime determinants of forms with class number 2.at n=51A002052
- a(n) = Sum_{k=0..n} f(k)*f(n-k) where f(k) = A002124(k).at n=24A002125
- Primes of the form 6m + 1.at n=51A002476
- a(n) = smallest number with shortest addition chain of length n.at n=13A003064
- Divisible only by primes congruent to 5 mod 7.at n=29A004623
- Divisible only by primes congruent to 7 mod 8.at n=36A004628
- Class 3+ primes (for definition see A005105).at n=36A005107
- Class 3- primes (for definition see A005109).at n=30A005111
- Fortunate numbers: least m > 1 such that m + prime(n)# is prime, where p# denotes the product of all primes <= p.at n=46A005235