Properties of the Number -33151

Thirty-Three Thousand One Hundred Fifty-One

Basics

Value: -33152 → -33151 → -33150

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 33151

Divisors: 1, 33151

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000000101111111

Octal: -100577

Duodecimal: -17227

Hexadecimal: -817f

Square: 1098988801

Square Root: 182.07416071480324

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

Numbers m that generate rotationally symmetrical XOR-triangles T(m) that have central triangles of zeros. A334769

Numbers k such that k² is palindromic in base 13. A29998

Primes from merging of 5 successive digits in decimal expansion of Euler-Mascheroni constant. A198779

Square array A(row>=1, col>=1) by antidiagonals: A(r,c) contains the c:th prime p for which A037888(p)=(r-1). A95749

Primes that are palindromic in base 13. A29980

Decimal Goedelization of antitheorems from propositional calculus, in Richard C. Schroeppel's metatheory of A101273. A100200

Smallest prime of the form: all threes followed by prime(n). a(n) >prime(n). 0 if no such prime exists. A114785

Smallest prime p = prime(k) such that the n-th difference of (prime(k), ..., prime(k+n)) is zero. A349643

a(n) = ∑_k=0..n binomial(4·n+1,k) * binomial(4·n-k,n-k). A383716

a(n) = 1 + 2·n + n² + 2·n³ + n⁴. A165563