Properties of the Number -4151

One Hundred Fifty-One

Basics

Value: -4152 → -4151 → -4150

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 7 × 593

Divisors: 1, 7, 593, 4151

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: -1000000110111

Octal: -10067

Duodecimal: -249B

Hexadecimal: -1037

Square: 17230801

Square Root: 64.42825467137845

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

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

Coefficients of expansion of:p(t,y)=-Exp[t/4]/(-2 + y·Exp[t/4] + y·Exp[3·t/4]). A171770

Numbers that are the sum of 4 positive 5th powers. A3349

Perfect Digital Invariants: numbers that are the sum of some fixed power of their digits. A23052

Iterate the map in A006368 starting at 40. A182205

a(1) = 1; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A74336

Number of strict integer partitions of n with all distinct lengths of maximal anti-runs (decreasing by more than 1). A384880

Numbers k such that 6^k - 5^k-1 is prime. A93713

Irregular table of perfect digital invariants for n > 1, i.e., numbers equal to the sum of n-th powers of their digits, read by rows. A252648

a(1) = 4; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A46254