Properties of the Number 31669

Thirty-One Thousand Six Hundred Sixty-Nine

Basics

Value: 31668 → 31669 → 31670

Parity: odd

Prime: No

Previous Prime: 31667

Next Prime: 31687

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 11 × 2879

Divisors: 1, 11, 2879, 31669

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111101110110101

Octal: 75665

Duodecimal: 163B1

Hexadecimal: 7bb5

Square: 1002925561

Square Root: 177.9578601804371

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 partitions of n such that 2*(greatest part) >= (number of parts). A237755

T(n,k) = Number of n X k 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors, with the exception of exactly two elements. A283100

Row sums of triangle A118441, which is the matrix log of triangle A118435. A118443

Smallest number with "natural" logarithm n, cf. A061373. A182061

a(n) = n*(n³ + 2·n² - 5·n + 10)/8. A294259

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + 2·b(n-1) - b(n-2) - 1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences. A294564

a(0) = 1, a(n) = 1 + 2·3 + 4·5 + 6·7 + ... + (2n)*(2n+1) for n > 0. A98931

Products (semiprimes) of two distinct double-safe primes. A157356

Number of n X 4 binary arrays with rows and columns lexicographically nondecreasing and row and column sums nonincreasing. A266543

Number of nX3 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors, with the exception of exactly two elements. A283095