Properties of the Number 1696

One Thousand Six Hundred Ninety-Six

Basics

Value: 1695 → 1696 → 1697

Parity: even

Prime: No

Previous Prime: 1693

Next Prime: 1697

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁵ × 53

Divisors: 1, 2, 4, 8, 16, 32, 53, 106, 212, 424

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010100000

Octal: 3240

Duodecimal: B94

Hexadecimal: 6a0

Square: 2876416

Square Root: 41.182520563948

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

Number of regions in regular n-gon with all diagonals drawn. A7678

a(n) = ∑_d∣n p(d), where p(d) = A000041 = number of partitions of d. A47968

Primitive abundant numbers (abundant numbers all of whose proper divisors are deficient numbers). A71395

Triangle read by rows of achiral color patterns (set partitions) for a row or loop of length n. T(n,k) is the number using exactly k colors (sets). A304972

The n-th n-gonal number: a(n) = n*(n² - 3·n + 4)/2. A60354

Primitive nondeficient numbers. A6039

Numbers with an even number of prime factors (counted with multiplicity) that cannot be factored into distinct semiprimes. A320892

Multiples of 16 containing a 16 in their decimal representation. A121036

Integers of the form m*(m + 6)/7. A274978

Array T read by diagonals; T(i,j) is the number of paths from (0,0) to (i,j) consisting of nonvertical segments (x(k),y(k))-to-(x(k+1),y(k+1)) such that 0 = x(1) < x(2) < ... < x(n-1) < x(n)=i, 0 = y(1) <= y(2) <= ... <= y(n-1) <= y(n)=j, for i >= 0, j >= 0. A49600