Properties of the Number 671

Six Hundred Seventy-One

Basics

Value: 670 → 671 → 672

Parity: odd

Prime: No

Previous Prime: 661

Next Prime: 673

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 11 × 61

Divisors: 1, 11, 61, 671

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1010011111

Octal: 1237

Duodecimal: 47B

Hexadecimal: 29f

Square: 450241

Square Root: 25.903667693977237

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

a(n) = n*(n² + 1)/2. A6003

Brilliant numbers: semiprimes (products of two primes, A001358) whose prime factors have the same number of decimal digits. A78972

a(n) = ∑_k=1..n n/gcd(n,k). A57660

Rhombic dodecahedral numbers: a(n) = n⁴ - (n - 1)⁴. A5917

Numbers whose binary expansion is a decimal prime. A36952

Square array of nexus numbers a(n,k) = (n+1)^k+1 - n^k+1 (n >= 0, k >= 0) read by upwards antidiagonals. A47969

Pseudoprimes to base 3. A5935

Generalized 14-gonal numbers: m*(6·m-5), m = 0,+1,-1,+2,-2,+3,-3,... A195818

Numbers n such that the number of squarefree numbers between prime(n) and prime(n+1) = prime(n+1)-prime(n)-1. A68361

Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1 <= k <= n-1, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if n is even and 1 <= k <= n/2, else T(n,k) = T(n-1,k-1) + T(n-1,k). A26747