Properties of the Number -29145

Twenty-Nine Thousand One Hundred Forty-Five

Basics

Value: -29146 → -29145 → -29144

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 29 × 67

Divisors: 1, 3, 5, 15, 29, 67, 87, 145, 201, 335

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111000111011001

Octal: -70731

Duodecimal: -14A49

Hexadecimal: -71d9

Square: 849431025

Square Root: 170.71906747636598

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 (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250812

a(n) is the concatenation of n and 5n. A19553

Numbers k such that k and k+1 are the product of exactly four distinct primes. A318896

a(n) = (2·n³ + 5·n² - 7·n)/2. A162261

Numbers k such that k·A001414(k)+1 is the square of a prime. A343141

Spiral sieve using Fibonacci numbers. A5624

Numbers n such that σ(2*φ(n)) = 2*σ(n). A137733

Number of (n+1) X (7+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250811

Number of (3+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250815

E.g.f. A(x) satisfies A(x) = x·exp(A(x)) * (1 + 2·A(x)). A376123