Properties of the Number 696

Six Hundred Ninety-Six

Basics

Value: 695 → 696 → 697

Parity: even

Prime: No

Previous Prime: 691

Next Prime: 701

Digit Sum: 21

Digital Root: 3

Palindrome: Yes

Factorization: 2 ³ × 3 × 29

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 29, 58

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1010111000

Octal: 1270

Duodecimal: 4A0

Hexadecimal: 2b8

Square: 484416

Square Root: 26.38181191654584

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

Numbers k such that (68·10^k + 7)/3 is prime. A270613

List of totally balanced sequences of 2n binary digits written in base 10. Binary expansion of each term contains n 0's and n 1's and reading from left to right (the most significant to the least significant bit), the number of 0's never exceeds the number of 1's. A14486

a(n) = 6·a(n-1) - a(n-2) + 2 with a(0) = 0, a(1) = 3. A1652

Number of balanced partitions of n: the largest part equals the number of parts. A47993

Sum of totient function: a(n) = ∑_k=1..n φ(k), cf. A000010. A2088

Numbers that are products of 5 primes (or 5-almost primes, a generalization of semiprimes). A14614

a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n² + 5)/6. A4006

Expansion of 1/((1 - x)*(1 - 2·x - x²)). A48739

Number of combinations which can be taken from the integer partitions of n. Total number of cases in the (n,m)-fragmentation process. A122768

Sums of twin prime pairs. A54735