Properties of the Number 698

Six Hundred Ninety-Eight

Basics

Value: 697 → 698 → 699

Parity: even

Prime: No

Previous Prime: 691

Next Prime: 701

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 349

Divisors: 1, 2, 349, 698

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1010111010

Octal: 1272

Duodecimal: 4A2

Hexadecimal: 2ba

Square: 487204

Square Root: 26.419689627245813

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

Triangle read by rows: T(n,k) is number of partitions of n with Durfee square of size k (n>=1; 1<=k<=floor(sqrt(n))). A115994

Twice partitioned numbers where the first partition is strict. A271619

T(n,m) = number of 0..m-1 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171307

Numbers m such that the Bernoulli number B_2·m has denominator 30. A51225

Number of partitions of n into parts which are all powers of the same prime. A64573

Numbers of the form p² + q², with p and q primes. A45636

Number of integer partitions of n whose sequence of frequencies is strictly increasing. A100471

G.f. A(x,y) satisfies: A( x - y·A(x,y)², y) = x + (1-y)*A(x,y)², where the coefficients T(n,k) of xⁿ*y^k form a triangle read by rows n>=1, for k=0..n-1. A277295

Number of incomplete strict integer partitions of n, meaning not every number from 0 to n is the sum of some submultiset. A365831

Numbers in which every digit contains at least one loop (version 1). A1743