Properties of the Number -30045

Thirty Thousand Forty-Five

Basics

Value: -30046 → -30045 → -30044

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 2003

Divisors: 1, 3, 5, 15, 2003, 6009, 10015, 30045

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111010101011101

Octal: -72535

Duodecimal: -15479

Hexadecimal: -755d

Square: 902702025

Square Root: 173.33493589002765

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 the maximum of every 2X2 subblock equal. A237035

Numbers k such that A276086(k) is a sum of distinct primorial numbers. A328836

Number of permutations p of [n] whose absolute displacements |p(i)-i| are Fibonacci numbers. A324373

Intersection of A392605 and A392611. A392606

Expansion of e.g.f. -log( 1 - (exp(x) - 1)³ / 3! ). A346390

First differences of A129983. A129984

a(0)=a(1)=1. For n >= 2, if a(n-1) is coprime to n, then a(n) = a(n-1) + a(n-2). Otherwise, a(n)=1. A139047

Irregular triangular array T(n,k) of consecutive composites. A226085

Number of (n+1) X (1+1) 0..2 arrays with the maximum of every 2 X 2 subblock equal. A237028

Number of (n+1)X(4+1) 0..2 arrays with the maximum of every 2X2 subblock equal. A237031