Properties of the Number 29590

Twenty-Nine Thousand Five Hundred Ninety

Basics

Value: 29589 → 29590 → 29591

Parity: even

Prime: No

Previous Prime: 29587

Next Prime: 29599

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 11 × 269

Divisors: 1, 2, 5, 10, 11, 22, 55, 110, 269, 538

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111001110010110

Octal: 71626

Duodecimal: 1515A

Hexadecimal: 7396

Square: 875568100

Square Root: 172.01744097619869

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

T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2, 4 or 5 king-move neighboring 1s. A296974

Number of ways to write n as an ordered sum of 5 prime powers (including 1). A341134

Triangle read by rows: Take a pentagon with all diagonals drawn, as in A331929. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+5. A331939

Consecutive states of the linear congruential pseudo-random number generator (25173·s+13849) mod 2¹⁶ when started at s=1. A383940

Difference between sum of largest parts and sum of smallest parts of all partitions of n into an even number of parts. A211881

a(n) = n*(3·n² - 5·n + 3). A226450

Growth function of an infinite cubic graph (number of nodes at distance <=n from fixed node). A38621

Number of nX4 0..1 arrays with each 1 adjacent to 2, 4 or 5 king-move neighboring 1s. A296970

Number of nX7 0..1 arrays with each 1 adjacent to 2, 4 or 5 king-move neighboring 1s. A296973

For n>0, a(n) is the least quasi-Carmichael number to base n; a(0) = least composite squarefree integer. A29590